Name
Abstract | ||
|---|---|---|
A new algorithm is introduced for analyzing possible nestings 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. These theoretical results are also supported by experimental tests run on a Java-based tool that implements a suite of algorithms for nesting analysis of mobile ambients. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.cl.2004.02.004 | Computer Languages, Systems & Structures |
Keywords | Field | DocType |
control flow analysis constraint,nesting analysis,new algorithm,mobile ambient calculus,mobile ambients,tools,java-based tool,static analysis,experimental test,complexity,ambient calculus,data structure representation,possible nestings,space complexity,control flow analysis,data structure | Data structure,Suite,Computer science,Static analysis,Spacetime,Theoretical computer science,Control flow analysis,Ambient calculus,Java,Computation | Journal |
Volume | Issue | ISSN |
30 | 3-4 | Computer Languages, Systems & Structures |
Citations | PageRank | References |
3 | 0.41 | 18 |
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 |