Bounded model checking of infinite state systems
Formal Methods in System Design
Proving ∀µ-calculus properties with SAT-based model checking
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Towards a model-checker for counter systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Contributions of model checking and CoFI methodology to the development of space embedded software
Empirical Software Engineering
| Hi-index | 0.00 |
Global and local model checking procedures follow radically different paradigms: while global approaches are based on fixpoint computation, local approaches are related to deduction and induction. For the verification of finite state systems, this may result in different runtimes. For the verification of infinite state systems, however, the differences are far more important. Since most problems are undecidable for such systems, it may be the case that one of the procedures does not terminate. In this paper, we compare global and local procedures for model checking µ-calculus properties of infinite state systems. In particular, we show how they can benefit from each other and present appropriate extensions.