Abstract | ||
---|---|---|
A new algorithm is introduced for analyzing possible nesting in Mobile Ambient calculus. It improves both time and space complexities of the technique proposed by Nielson and Seidl. The improvements are achieved by enhancing the data structure representations, and by reducing the computation to the Control Flow Analysis constraints that are effectively necessary to get to the least solution. |
Year | DOI | Venue |
---|---|---|
2003 | 10.1007/3-540-36384-X_10 | VMCAI |
Keywords | Field | DocType |
mobile ambient calculus,mobile ambients,data structure representation,new algorithm,control flow analysis constraint,nesting analysis,space complexity,control flow analysis,data structure,static analysis,ambient calculus | Data structure,Computer science,Static analysis,Spacetime,Theoretical computer science,Control flow analysis,Program analysis,Ambient calculus,Computation | Conference |
Volume | ISSN | ISBN |
2575 | 0302-9743 | 3-540-00348-7 |
Citations | PageRank | References |
2 | 0.37 | 19 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Chiara Braghin | 1 | 105 | 8.86 |
Agostino Cortesi | 2 | 791 | 66.19 |
Riccardo Focardi | 3 | 1229 | 99.99 |
Flaminia L. Luccio | 4 | 352 | 33.10 |
Carla Piazza | 5 | 111 | 17.16 |