Model checking mobile ambients

We settle the complexity bounds of the model checking problem for the ambient calculus with public names against the ambient logic. We show that if either the calculus contains replication or the logic contains the guarantee operator, the problem is undecidable. In the case of the replication-free calculus and guarantee-free logic we prove that the problem is PSPACE-complete. For the complexity upper bound, we devise a new representation of processes that remains of polynomial size during process execution; this allows us to keep the model checking procedure in polynomial space. Moreover, we prove PSPACE-hardness of the problem for several quite simple fragments of the calculus and the logic; this suggests that there are no interesting fragments with polynomial-time model checking algorithms.

[1]  Alasdair Urquhart,et al.  Semantics for relevant logics , 1972, Journal of Symbolic Logic.

[2]  Luca Cardelli,et al.  Anytime, anywhere: modal logics for mobile ambients , 2000, POPL '00.

[3]  Luca Cardelli,et al.  A Spatial Logic for Concurrency (Part II) , 2002, CONCUR.

[4]  John C. Reynolds,et al.  Intuitionistic reasoning about shared mutable data structure , 1999 .

[5]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[6]  Luca Cardelli,et al.  Equational properties of mobile ambients , 1999, Mathematical Structures in Computer Science.

[7]  Peter W. O'Hearn,et al.  The Logic of Bunched Implications , 1999, Bulletin of Symbolic Logic.

[8]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[9]  Silvano Dal Zilio,et al.  The Complexity of Model Checking Mobile Ambients – DRAFT VERSION – , 2000 .

[10]  Luca Cardelli,et al.  A Query Language Based on the Ambient Logic , 2001, SEBD.

[11]  Silvano Dal Zilio,et al.  Spatial Congruence for Ambients Is Decidable , 2000 .

[12]  Pierre Wolper,et al.  An automata-theoretic approach to branching-time model checking , 2000, JACM.

[13]  Witold Charatonik,et al.  The Decidability of Model Checking Mobile Ambients , 2001, CSL.

[14]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[15]  Luca Cardelli,et al.  A Spatial Logic for Querying Graphs , 2002, ICALP.

[16]  Emil L. Post.  Recursively enumerable sets of positive integers and their decision problems , 1944 .

[17]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[18]  Luca Cardelli,et al.  Logical Properties of Name Restriction , 2001, TLCA.

[19]  Davide Sangiorgi,et al.  Separability, expressiveness, and decidability in the ambient logic , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[20]  Mads Dam,et al.  Relevance logic and concurrent composition , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[21]  Luca Cardelli,et al.  A spatial logic for concurrency (part I) , 2003, Inf. Comput..

[22]  Davide Sangiorgi,et al.  Extensionality and intensionality of the ambient logics , 2001, POPL '01.

[23]  Jean-Yves Girard,et al.  Linear Logic and Lazy Computation , 1987, TAPSOFT, Vol.2.

[24]  Peter W. O'Hearn,et al.  Local Reasoning about Programs that Alter Data Structures , 2001, CSL.

[25]  Nadia Busi,et al.  On the Expressiveness of Movement in Pure Mobile Ambients , 2002, Electron. Notes Theor. Comput. Sci..

[26]  Witold Charatonik,et al.  Finite-Control Mobile Ambients , 2002, ESOP.

[27]  Luca Cardelli,et al.  Types for mobile ambients , 1999, POPL '99.

[28]  Luís Monteiro,et al.  Verifiable and Executable Logic Specifications of Concurrent Objects in Lpi , 1998, ESOP.

[29]  Peter W. O'Hearn,et al.  BI as an assertion language for mutable data structures , 2001, POPL '01.

[30]  Luca Cardelli,et al.  A Spatial Logic for Concurrency , 2001, TACS.