Foundations of logic programming
Foundations of logic programming
Linear logic and lazy computation
II and Colloquium on Functional and Logic Programming and Specifications (CFLP) on TAPSOFT '87: Advanced Seminar on Foundations of Innovative Software Development
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Extensionality and intensionality of the ambient logics
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
BI as an assertion language for mutable data structures
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verifiable and Executable Logic Specifications of Concurrent Objects in Lpi
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
Finite-Control Mobile Ambients
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Separability, Expressiveness, and Decidability in the Ambient Logic
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Spatial Logic for Concurrency
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
A Spatial Logic for Querying Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Spatial Logic for Concurrency (Part II)
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Logical properties of name restriction
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deciding validity in a spatial logic for trees
Journal of Functional Programming
Axiomatisation and decidability of multi-dimensional Duration Calculus
Information and Computation
Expressiveness and complexity of graph logic
Information and Computation
Expressing and Verifying Temporal and Structural Properties of Mobile Agents
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Undecidability of Model Checking in Brane Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Deciding Reachability in Mobile Ambients with Name Restriction
Electronic Notes in Theoretical Computer Science (ENTCS)
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Abstract interpretation based verification of temporal properties for BioAmbients
Information and Computation
Formal specification of wireless and pervasive healthcare applications
ACM Transactions on Embedded Computing Systems (TECS)
Model checking of location and mobility related security policy specifications in ambient calculus
MMM-ACNS'10 Proceedings of the 5th international conference on Mathematical methods, models and architectures for computer network security
Formal Specification and Verification of Ubiquitous and Pervasive Systems
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Modal logics for brane calculus
CMSB'06 Proceedings of the 2006 international conference on Computational Methods in Systems Biology
Deciding safety properties in infinite-state pi-calculus via behavioural types
Information and Computation
Introduction to special section on formal methods in pervasive computing
ACM Transactions on Autonomous and Adaptive Systems (TAAS) - Special section on formal methods in pervasive computing, pervasive adaptation, and self-adaptive systems: Models and algorithms
Expressing and Verifying Temporal and Structural Properties of Mobile Agents
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
A formal role-based access control model for security policies in multi-domain mobile networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 5.23 |
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.