Abstract Regular Model Checking

Ahmed Bouajjani (1) , Peter Habermehl (1) , Tomas Vojnar (2)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
2 FIT / BUT - Faculty of Information Technology [Brno]

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

Mots clés: Infinite-state model checking; regular model checking; verification by abstraction; counterexample-guided abstraction refinement

Domaines: Performance et fiabilité [cs.PF]

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⟩