Limits for automatic verification of finite-state concurrent systems
Information Processing Letters
Parallel program design: a foundation
Parallel program design: a foundation
A structural induction theorem for processes
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
First-order logic and automated theorem proving
First-order logic and automated theorem proving
Presburger arithmetic with unary predicates is P11 complete
Journal of Symbolic Logic
Theorem proving using equational matings and rigid E-unification
Journal of the ACM (JACM)
Reasoning about systems with many processes
Journal of the ACM (JACM)
Simplification of boolean verification conditions
Theoretical Computer Science
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
Deductive verification of real-time systems using STeP
Theoretical Computer Science - Special issue on real-time systems and concurrent and distributed software
Distributed Algorithms
A Discipline of Programming
A Proof of Burns N-Process Mutual Exclusion Algorithm Using Abstraction
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
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
Verifying Properties of Large Sets of Processes with Network Invariants
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Symbolic Model Checking with Rich ssertional Languages
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Verification of Real-Time Systems Using PVS
CAV '93 Proceedings of the 5th 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
Verifying Invariants Using theorem Proving
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Compiling with proofs
A uniform deductive approach for parameterized protocol safety
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Model Checking of Control-User Component-Based Parametrised Systems
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Decidable fragments of many-sorted logic
Journal of Symbolic Computation
Automated Computing of the Maximal Number of Handled Clients for Client-Server Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Combining Non-stably Infinite, Non-first Order Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
Guiding the correction of parameterized specifications
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Combinations of theories for decidable fragments of first-order logic
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Instantiation of parameterized data structures for model-based testing
B'07 Proceedings of the 7th international conference on Formal Specification and Development in B
ABZ'12 Proceedings of the Third international conference on Abstract State Machines, Alloy, B, VDM, and Z
Symbolic backward reachability with effectively propositional logic
Formal Methods in System Design
| Hi-index | 0.00 |
The control part of many concurrent and distributed programs reduces to a set Π = {p1, ..., pn} of symmetric processes containing mainly assignments and tests on Boolean variables. However, the assignments, the guards and the program invariants can be Π-quantified, so the corresponding verification conditions also involve Π-quantifications. We propose a systematic procedure allowing the elimination of such quantifications for a large class of program invariants. At the core of this procedure is a variant of the Herbrand Theorem for many-sorted first-order logic with equality.