Skip to Main content Skip to Navigation
New interface
Conference papers

Abstract Regular Model Checking

Abstract : We propose abstract regular model checking as a new generic technique for verification of parametric and infinite-state systems. The technique combines the two approaches of regular model checking and verification by abstraction. We propose a general framework of the method as well as several concrete ways of abstracting automata or transducers, which we use for modelling systems and encoding sets of their states as usual in regular model checking. The abstraction is based on collapsing states of automata (or transducers) and its precision is being incrementally adjusted by analysing spurious counterexamples. We illustrate the technique on verification of a wide range of systems including a novel application of automata-based techniques to an example of systems with dynamic linked data structures
Document type :
Conference papers
Complete list of metadata
Contributor : Peter Habermehl Connect in order to contact the contributor
Submitted on : Tuesday, July 3, 2007 - 2:09:51 PM
Last modification on : Saturday, November 20, 2021 - 3:49:42 AM
Long-term archiving on: : Thursday, April 8, 2010 - 10:26:21 PM


Files produced by the author(s)


  • HAL Id : hal-00159512, version 1



Ahmed Bouajjani, Peter Habermehl, Tomas Vojnar. Abstract Regular Model Checking. International Conference on Computer Aided Verification 2004, 2004, Boston, United States. pp.372-386. ⟨hal-00159512⟩



Record views


Files downloads