A calculus of mobile processes, II
Information and Computation
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Verifying parameterized networks
ACM Transactions on Programming Languages and Systems (TOPLAS)
Verifying Systems with Replicated Components in Mur&b.phiv;
Formal Methods in System Design
Types as models: model checking message-passing programs
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communication and Concurrency
Automatic Deductive Verification with Invisible Invariants
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A Compositional Rule for Hardware Design Refinement
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Automatic Verification of Parameterized Cache Coherence Protocols
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Liveness and Acceleration in Parameterized Verification
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Parameterized Verification with Automatically Computed Inductive Assertions
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Automatic Verification of Parameterized Synchronous Systems (Extended Abstract)
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Efficient model checking via the equational /spl mu/-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On Model Checking for Non-Deterministic Infinite-State Systems
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
On the Verification of Broadcast Protocols
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Proof systems for π-calculus logics
Logic for concurrency and synchronisation
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)
Compositional analysis for verification of parameterized systems
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Symbolic compositional verification by learning assumptions
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
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
Model checking and abstraction to the aid of parameterized systems (a survey)
Computer Languages, Systems and Structures
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
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
| Hi-index | 0.00 |
In this paper we present an automatic verification technique for parameterized systems where the subsystem behavior is modeled using the π-calculus. At its core, our technique treats each process instance in a system as a property transformer. Given a property ϕ that we want to verify of an N-process system, we use a partial model checker to infer the property ϕ′ (stated as a formula in a sufficiently rich logic) that must hold of an (N – 1)-process system. If the sequence of formulas ϕ,ϕ′,... thus constructed converges, and the limit is satisfied by the deadlocked process, we can conclude that the N-process system satisfies ϕ. To this end, we develop a partial model checker for the π-calculus that uses an expressive value-passing logic as the property language. We also develop a number of optimizations to make the model checker efficient enough for routine use, and a light-weight widening operator to accelerate convergence. We demonstrate the effectiveness of our technique by using it to verify properties of a wide variety of parameterized systems that are beyond the reach of existing techniques.