Name
Abstract | ||
|---|---|---|
We consider a type discipline for the Ambient Calculus that associates ambients with security levels and constrains them to be traversed by or opened in ambients of higher security clearance only. We present a bottom-up algorithm that, given an untyped process P, computes a minimal set of constraints on security levels such that all actions during runs of P are performed without violating the security level priorities. Such an algorithm appears to be a prerequisite to use type systems to ensure security properties in the web scenario. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1016/S1571-0661(04)00321-4 | Electronic Notes in Theoretical Computer Science |
Keywords | Field | DocType |
ambient calculus,type system,bottom up,type inference | Security level,Computer science,Algorithm,Type inference,Theoretical computer science,Security properties,Ambient calculus | Journal |
Volume | ISSN | Citations |
62 | 1571-0661 | 5 |
PageRank | References | Authors |
0.39 | 11 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Franco Barbanera | 1 | 357 | 35.14 |
| Mariangiola Dezani-Ciancaglini | 2 | 1615 | 193.57 |
| Ivano Salvo | 3 | 140 | 14.70 |
| Vladimiro Sassone | 4 | 1498 | 104.86 |