Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | POPL'00 Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages |
| Publisher | ACM Press |
| Publication date | 2000 |
| Pages | 142-154 |
| ISBN (Print) | 1-58113-125-9 |
| DOIs | |
| Publication status | Published - 2000 |
| Event | 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - Boston, United States Duration: 19 Jan 2000 → 21 Jan 2000 Conference number: 27 |
Conference
| Conference | 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages |
|---|---|
| Number | 27 |
| Country/Territory | United States |
| City | Boston |
| Period | 19/01/2000 → 21/01/2000 |
Fingerprint
Dive into the research topics of 'Shape analysis for Mobile Ambients'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver