References

[1]

P. Cousot and R. Cousot. Static determination of dynamic properties of programs. In Proceedings of the Second International Symposium on Programming, pages 106--130. Dunod, Paris, France, 1976.

[2]

P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. POPL'77, pages 238--252, Los Angeles, California, U.S.A., 1977.

[3]

P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of logic and computation, 2(4):511--547, 1992.

[4]

J. Feret. p-s.a. 3 : A p-calculus static analyzer. Available prototype.

[5]

J. Feret. Confidentiality Analysis of Mobile Systems. In Seventh International Static Analysis Symposium (SAS'00), number 1824 in LNCS, pages 135--154. Springer-Verlag, 2000.

[6]

J. Feret. Occurrence Counting Analysis for the pi-Calculus. Electronic Notes in Theoretical Computer Science, 39.2, 2001. Workshop on GEometry and Topology in COncurrency theory, PennState, USA, August 21, 2000.

[7]

M. Karr. Affine relationships among variables of a program. Acta Informatica, pages 133--151, 1976.

[8]

R. Milner. The polyadic p-calculus: a tutorial. In Proceedings of the International Summer School on Logic and Algebra of Specification. Springer Verlag, 1991.

[9]

R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes. Information and Computation, 100:1--77, 1992.

[10]

A. Miné. The Octagon Abstract Domain. In AST 2001 in WCRE 2001, IEEE, pages 310--319. IEEE CS Press, October 2001.