Abstract Interpretation of the pi-Calculus

We are concerned with the static analysis of the communication topology for systems of mobile processes. For this purpose we construct an abstract interpretation of a large fragment of the π-calculus which can be used as a metalanguage to specify the behaviour of these systems. The abstract domain is expressive enough to give accurate descriptions of infinite and non-uniform distributions of processes and communication channels. We design appropriate widening operators for the automatic inference of such information.

[1]  Patrick Cousot,et al.  Static determination of dynamic properties of programs , 1976 .

[2]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[3]  Nicolas Halbwachs,et al.  Automatic discovery of linear restraints among variables of a program , 1978, POPL.

[4]  Neil D. Jones,et al.  Flow analysis and optimization of LISP-like structures , 1979, POPL.

[5]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[6]  Philippe Granger.  Static analysis of arithmetical congruences , 1989 .

[7]  Michael Barr,et al.  Category theory for computing science , 1995, Prentice Hall International Series in Computer Science.

[8]  Robin Milner.  Functions as Processes , 1990, ICALP.

[9]  Philippe Granger,et al.  Static Analysis of Linear Congruence Equalities among Variables of a Program , 1991, TAPSOFT, Vol.1.

[10]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[11]  Annegret Habel,et al.  Hyperedge Replacement: Grammars and Languages , 1992, Lecture Notes in Computer Science.

[12]  Patrick Cousot,et al.  Abstract Interpretation Frameworks , 1992, J. Log. Comput..

[13]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[14]  A. Deutsch,et al.  A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relations , 1992, Proceedings of the 1992 International Conference on Computer Languages.

[15]  Matthew Hennessy,et al.  A theory of processes with localities , 1992 .

[16]  Davide Sangiorgi,et al.  Expressing mobility in process algebras : first-order and higher-order paradigms , 1993 .

[17]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[18]  Alain Deutsch,et al.  Interprocedural may-alias analysis for pointers: beyond k-limiting , 1994, PLDI '94.

[19]  Flemming Nielson,et al.  Higher-order concurrent programs with finite communication topology (extended abstract) , 1994, POPL '94.

[20]  Davide Sangiorgi,et al.  Locality and True-concurrency in Calculi for Mobile Processes , 1994, TACS.

[21]  Christopher Colby,et al.  Determining Storage Properties of Sequential and Concurrent Programs with Assignment and Structured Data , 1995, SAS.

[22]  Christopher Colby.  Analyzing the communication topology of concurrent programs , 1995, PEPM '95.

[23]  Patrick Cousot,et al.  Compositional and Inductive Semantic Definitions in Fixpoint, Equational, Constraint, Closure-condition, Rule-based and Game-Theoretic Form , 1995, CAV.

[24]  Arnaud Venet,et al.  Abstract Cofibered Domains: Application to the Alias Analysis of Untyped Programs , 1996, SAS.

[25]  David N. Turner,et al.  The polymorphic Pi-calculus : theory and implementation , 1996 .