SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems. Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system is correct, it is desirable for a verifier to obtain not a simple ”yes” answer, but some independently checkable certificate of correctness. We present SLAB — the first certifying model checker for infinite-state concurrent systems. The tool uses a procedure that interleaves automatic abstraction refinement using Craig interpolation with slicing, which removes irrelevant states and transitions from the abstraction. Given a transition system and a safety property to check, SLAB either finds a counterexample or produces a certificate of system correctness in the form of inductive verification diagram.
Keywords for this software
References in zbMATH (referenced in 8 articles )
Showing results 1 to 8 of 8.
- Jhala, Ranjit; Podelski, Andreas; Rybalchenko, Andrey: Predicate abstraction for program verification (2018)
- Kaiser, Alexander; Kroening, Daniel; Wahl, Thomas: Lost in abstraction: monotonicity in multi-threaded programs (2017)
- Christ, Jürgen; Hoenicke, Jochen: Proof tree preserving tree interpolation (2016)
- Totla, Nishant; Wies, Thomas: Complete instantiation-based interpolation (2016)
- Olderog, Ernst-Rüdiger; Swaminathan, Mani: Structural transformations for data-enriched real-time systems (2015)
- Ermis, Evren; Hoenicke, Jochen; Podelski, Andreas: Splitting via interpolants (2012)
- Olderog, Ernst-Rüdiger: Automatic verification of real-time systems with rich data: an overview (2012) ioport
- Dräger, Klaus; Kupriyanov, Andrey; Finkbeiner, Bernd; Wehrheim, Heike: SLAB: a certifying model checker for infinite-state concurrent systems (2010) ioport