Abstract
We show how a program analysis technique originally developed for C-like pointer structures can be adapted to analyse the hierarchical structure of processes in the ambient calculus. The technique is based on modeling the semantics of the language in a two-valued logic; by reinterpreting the logical formulae in Kleene's three-valued logic we obtain an analysis allowing us to reason about may as well as must properties. The correctness of the approach follows from a general Embedding Theorem for Kleene's logic; furthermore embeddings allow us to reduce the size of structures so as to control the time and space complexity of the analysis.
| Original language | English |
|---|---|
| Title of host publication | Proc. ESOP'00 |
| Publisher | Springer Verlag |
| Publication date | 2000 |
| Pages | 305-319 |
| Publication status | Published - 2000 |
| Event | Proc. ESOP'00 - Duration: 1 Jan 2000 → … |
Conference
| Conference | Proc. ESOP'00 |
|---|---|
| Period | 01/01/2000 → … |