Local model checking in the modal mu-calculus
TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
A calculus of mobile processes, I
Information and Computation
An attack on the Needham-Schroeder public-key authentication protocol
Information Processing Letters
A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
Analyzing security protocols with secrecy types and logic programs
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communication and Concurrency
Handbook of Process Algebra
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming
Proceedings of the 17th International Conference on Logic Programming
An Optimizing Compiler for Efficient Model Checking
FORTE XII / PSTV XIX '99 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XII) and Protocol Specification, Testing and Verification (PSTV XIX)
Verification of Parameterized Systems Using Logic Program Transformations
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
From Secrecy to Authenticity in Security Protocols
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
A System for Tabled Constraint Logic Programming
CL '00 Proceedings of the First International Conference on Computational Logic
ASA/MA 2000 Proceedings of the Second International Symposium on Agent Systems and Applications and Fourth International Symposium on Mobile Agents
Efficient Model Checking Using Tabled Resolution
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
The Mobility Workbench - A Tool for the pi-Calculus
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
A theorem-proving approach to deciding properties of finite control agents
A theorem-proving approach to deciding properties of finite control agents
Authenticity by Typing for Security Protocols
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Proof systems for π-calculus logics
Logic for concurrency and synchronisation
A semantic framework for open processes
Theoretical Computer Science
Deducing interactions in partially unspecified biological systems
AB'07 Proceedings of the 2nd international conference on Algebraic biology
Infinite computation, co-induction and computational logic
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Resource usage analysis for the π-calculus
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
From the π-calculus to flat GHC
Proceedings of the 14th symposium on Principles and practice of declarative programming
| Hi-index | 0.00 |
We present MMC, a model checker for mobile systems specified in the style of the 驴-calculus. MMC's development builds on our experience gained in developing XMC, a model checker for an extension of Milner's value-passing calculus implemented using the XSB tabled logic-programming system. MMC, however, is not simply an extension of XMC; rather it is virtually a complete re-implementation that addresses the salient issues that arise in the 驴-calculus, including scope extrusion and intrusion, and dynamic generation of new names to avoid name capture. We show that tabled logic programming is especially suitable as an efficient implementation platform for model checking 驴-calculus specifications, and can be used to obtain an exact encoding of the 驴-calculus's transitional semantics. Moreover, MMC is easily extended to handle process expressions in the spi-calculus. Our experimental data shows that MMC outperforms other known tools for model checking the 驴-calculus.