A provably correct compiler for efficient model checking of mobile processes

Authors:
Ping Yang;Yifei Dong;C. R. Ramakrishnan;Scott A. Smolka
Affiliations:
Dept. of Computer Science, Stony Brook Univ., Stony Brook, NY;School of Computer Science, Univ. of Oklahoma, Norman, OK;Dept. of Computer Science, Stony Brook Univ., Stony Brook, NY;Dept. of Computer Science, Stony Brook Univ., Stony Brook, NY
Venue:
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Year:
2005

Citing 18
Cited 3

Foundations of logic programming

Foundations of logic programming
A calculus of mobile processes, I

Information and Computation
Tabled evaluation with delaying for general logic programs

Journal of the ACM (JACM)
Symmetry and model checking

Formal Methods in System Design - Special issue on symmetry in automatic verification
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
A calculus for cryptographic protocols: the spi calculus

Proceedings of the 4th ACM conference on Computer and communications security
A Unification Algorithm for Associative-Commutative Functions

Journal of the ACM (JACM)
Pict: a programming language based on the Pi-Calculus

Proof, language, and interaction
Types as models: model checking message-passing programs

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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)
Model Checking in CLP

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Associative-Commutative Discrimination Nets

TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Efficient Model Checking Using Tabled Resolution

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
A constraint-based approach for specification and verification of real-time systems

RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Proof systems for π-calculus logics

Logic for concurrency and synchronisation
Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories

Journal of Functional Programming
A generic type system for the Pi-calculus

Theoretical Computer Science
A logical encoding of the π-calculus: model checking mobile processes using tabled resolution

International Journal on Software Tools for Technology Transfer (STTT)

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
Parameterized verification of π-calculus systems

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an optimizing compiler for the π-calculus that significantly improves the time and space performance of the MMC model checker. MMC exploits the similarity between the manner in which resolution techniques handle variables in a logic program and the manner in which the operational semantics of the π-calculus handles names by representing π-calculus names in MMC as Prolog variables, with distinct names represented by distinct variables. Given a π-calculus process P, our compiler for MMC produces an extremely compact representation of P’s symbolic state space as a set of transition rules. It also uses AC unification to recognize states that are equivalent due to symmetry.