We demonstrate that abstract interpretation is useful for analysing calculi of computation such as the ambient calculus (which is based on the p-calculus); more importantly, we show that the entire development can be expressed in a constraint-based formalism that is becoming exceedingly popular for the analysis of functional and object-oriented languages. The first step of the development is an analysis for counting occurrences of processes inside other processes (for which we show semantic correctness and that solutions constitute a Moore family); the second step is a previously developed control flow analysis that we show how to induce from the counting analysis (and its properties are derived from those of the counting analysis using general results).
|Title of host publication||Proc. SAS'99|
|Publication status||Published - 1999|
|Event||Proc. SAS'99 - |
Duration: 1 Jan 1999 → …
|Period||01/01/1999 → …|