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 safety 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). The underlying ideas are flexible and scale up to general tree structures admitting powerful restructuring operations.
|Title of host publication||POPL'00 Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages|
|Publication status||Published - 2000|
|Event||27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL '00) - Boston, MA, United States|
Duration: 19 Jan 2000 → 21 Jan 2000
Conference number: 27
|Conference||27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL '00)|
|Period||19/01/2000 → 21/01/2000|