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 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).
Original language | English |
---|---|
Journal | Nordic Journal of Computing |
Volume | 8 |
Issue number | 2 |
Pages (from-to) | 233-275 |
ISSN | 1236-6064 |
Publication status | Published - 2001 |
Keywords
- Mobile Ambients
- Static analysis
- Shape analysis