Declaration-free type checking
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Flow-sensitive type systems and the ambient calculus
Higher-Order and Symbolic Computation
Computer Languages, Systems and Structures
Flow-sensitive Leakage Analysis in Mobile Ambients
Electronic Notes in Theoretical Computer Science (ENTCS)
Program analysis and compilation, theory and practice
| Hi-index | 0.00 |
The ambient calculus is a calculus of computation that allows active processes to move between sites. We present an analysis inspired by state-of-the-art pointer analyses that safely and accurately predicts which processes may turn up at what sites during the execution of a composite system. The analysis models sets of processes by sets of regular tree grammars enhanced with context dependent counts, and it obtains its precision by combining a powerful redex materialisation with a strong redex reduction (in the manner of the strong updates performed in pointer analyses).