Publication Details
Abstract Regular Model Checking
formal verification, infinite-state and parameterized systems, regular model checking, abstraction
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 configurations 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.
@ARTICLE{FITPUB7410,
author = "Ahmed Bouajjani and Peter Habermehl and Tom\'{a}\v{s} Vojnar",
title = "Abstract Regular Model Checking",
pages = "372--386",
booktitle = "Computer Aided Verification",
journal = "Lecture Notes in Computer Science",
volume = 2004,
number = 3114,
year = 2004,
location = "Berlin, DE",
publisher = "Springer Verlag",
ISSN = "0302-9743",
doi = "10.1007/978-3-540-27813-9\_29",
language = "english",
url = "https://www.fit.vut.cz/research/publication/7410"
}