Reasoning about systems with many processes
Journal of the ACM (JACM)
A closed-form evaluation for Datalog queries with integer (gap)-order constraints
ICDT Selected papers of the 4th international conference on Database theory
ACM Transactions on Programming Languages and Systems (TOPLAS)
Algorithmic analysis of programs with well quasi-ordered domains
Information and Computation - Special issue: LICS 1996—Part 1
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Symbolic model checking with rich assertional languages
Theoretical Computer Science
Beyond Parameterized Verification
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Regular Model Checking Made Simple and Efficient
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Symbolic Verification with Gap-Order Constraints
LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
Automatic Verification of Parameterized Cache Coherence Protocols
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
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
Regular model checking without transducers (on efficient verification of parameterized systems)
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Parameterized verification of infinite-state processes with global conditions
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Abstract regular tree model checking of complex dynamic data structures
SAS'06 Proceedings of the 13th international conference on Static Analysis
Environment abstraction for parameterized verification
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Automatic verification of parametric specifications with complex topologies
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Verification of gap-order constraint abstractions of counter systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Strong termination for gap-order constraint abstractions of counter systems
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
CSP-based counter abstraction for systems with node identifiers
Science of Computer Programming
Verification of gap-order constraint abstractions of counter systems
Theoretical Computer Science
| Hi-index | 0.00 |
We present a simple and effective approximated backward reachability procedure for parameterized systems with existentially and universally quantified global conditions. The individual processes operate on unbounded local variables ranging over the natural numbers. In addition, processes may communicate via broadcast, rendez-vous and shared variables. The procedure operates on an over-approximation of the transition system induced by the parameterized system. We verify mutual exclusion for complex protocols such as atomic, non-atomic and distributed versions of Lamport's bakery algorithm.