Journal article

BOUAJJANI Ahmed, HABERMEHL Peter, ROGALEWICZ Adam and VOJNAR Tomáš. Abstract Regular (Tree) Model Checking. International Journal on Software Tools for Technology Transfer. 2012, vol. 14, no. 2, pp. 167-191. ISSN 1433-2779. Available from: http://www.springerlink.com/content/137uu7118p2054j2/
Publication language:english
Original title:Abstract Regular (Tree) Model Checking
Title (cs):Abstraktní regulární (stromový) model checking
Pages:167-191
Place:DE
Year:2012
URL:http://www.springerlink.com/content/137uu7118p2054j2/
Journal:International Journal on Software Tools for Technology Transfer, Vol. 14, No. 2, DE
ISSN:1433-2779
Keywords
Formal verification, Infinite-state and parameterised systems, Programs with dynamic linked data structures, Regular model checking, Abstraction, Finite word and tree automata
Annotation
Regular model checking is a generic technique for verification of infinite-state and/or parametrised systems which uses finite word automata or finite tree automata to finitely represent potentially infinite sets of reachable configurations of the systems being verified. The problems addressed by regular model checking are typically undecidable. In order to facilitate termination in as many cases as possible, acceleration is needed in the incremental computation of the set of reachable configurations in regular model checking. In this work, we describe how various incrementally refinable abstractions on finite (word and tree) automata can be used for this purpose. Moreover, the use of abstraction does not only increase chances of the technique to terminate, but it also significantly reduces the problem of an explosion in the number of states of the automata that are generated by regular model checking. We illustrate the efficiency of abstract regular (tree) model checking in verification of simple systems with various sources of infinity such as unbounded counters, queues, stacks, and parameters. We then show how abstract regular tree model checking can be used for verification of programs manipulating tree-like dynamic data structures. Even more complex data structures can be handled using a suitable tree-like encoding.
BibTeX:
@ARTICLE{
   author = {Ahmed Bouajjani and Peter Habermehl and Adam Rogalewicz and
	Tomáš Vojnar},
   title = {Abstract Regular (Tree) Model Checking},
   pages = {167--191},
   journal = {International Journal on Software Tools for Technology
	Transfer},
   volume = {14},
   number = {2},
   year = {2012},
   ISSN = {1433-2779},
   language = {english},
   url = {http://www.fit.vutbr.cz/research/view_pub.php?id=9968}
}

Your IPv4 address: 54.234.74.85
Switch to IPv6 connection

DNSSEC [dnssec]