Towards SMT Model Checking of Array-Based Systems
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
State space abstraction for parameterized self-stabilizing embedded systems
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Invariants for Parameterised Boolean Equation Systems
Theoretical Computer Science
On verifying fault tolerance of distributed protocols
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Making prophecies with decision predicates
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Invisible invariants and abstract interpretation
SAS'11 Proceedings of the 18th international conference on Static analysis
Parameterized verification of deadlock freedom in symmetric cache coherence protocols
Proceedings of the International Conference on Formal Methods in Computer-Aided Design
Proving the refuted: symbolic model checkers as proof generators
Concurrency, Compositionality, and Correctness
Automated analysis of parametric timing-based mutual exclusion algorithms
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
| Hi-index | 0.00 |
The method of invisible invariants was developed originally in order to verify safety properties of parameterized systems in a fully automatic manner. The method is based on (1) a project&generalize heuristic to generate auxiliary constructs for parameterized systems and (2) a small-model theorem, implying that it is sufficient to check the validity of logical assertions of a certain syntactic form on small instantiations of a parameterized system. The approach can be generalized to any deductive proof rule that (1) requires auxiliary constructs that can be generated by project&generalize, and (2) the premises resulting when using the constructs are of the form covered by the small-model theorem.The method of invisible ranking, presented here, generalizes the approach to liveness properties of parameterized systems. Starting with a proof rule and cases where the method can be applied almost “as is,” the paper progresses to develop deductive proof rules for liveness and extend the small-model theorem to cover many intricate families of parameterized systems.