Model checking for π-calculus using proof search
CONCUR 2005 - Concurrency Theory
A process calculus for Mobile Ad Hoc Networks
Science of Computer Programming
A process calculus for mobile ad hoc networks
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Translating Pi-calculus into LOTOS NT
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
An Epistemic Predicate CTL* for Finite Control π-Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Model checking for nominal calculi
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A provably correct compiler for efficient model checking of mobile processes
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Parameterized verification of π-calculus systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Formal specification and verification of vehicular handoff using π-calculus
Proceedings of the 1st International Conference on Wireless Technologies for Humanitarian Relief
A logical verification methodology for service-oriented computing
ACM Transactions on Software Engineering and Methodology (TOSEM)
SLMC: a tool for model checking concurrent systems against dynamical spatial logic specifications
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Model checking with probabilistic tabled logic programming
Theory and Practice of Logic 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 that of XMC, a model checker for an expressive extension of Milner’s value-passing calculus implemented using the XSB tabled logic-programming engine. MMC 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 logic programming provides 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 of Abadi and Gordon. Our experimental data show that MMC outperforms other known tools for model checking the π-calculus.