Abstract Regular Tree Model Checking

• http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B75H1-4J3Y06T-4-1&_cdi=13109&_user=640830&_orig=browse&_coverDate=02%2F03%2F2006&_sk=998509998&view=c&wchp=dGLbVlz-zSkWA&md5=8e10fd6367f1b94bb331d35d09b3ae26&ie=/sdarticle.pdf

formal verification, model checking, symbolic verification, regular model checking, the abstrack-check-refine paradigm, finite tree automata

Regular (tree) model checking (RMC)  is a promising generic method for formal verification of infinite-state systems. It encodes configurations of systems as words or trees over a suitable alphabet, possibly infinite sets of configurations as finite word or tree automata, and operations of the systems being examined as finite word or tree transducers. The reachability set is then computed by a repeated application of the transducers on the automata representing the currently known set of reachable configurations. In order to facilitate termination of RMC, various acceleration schemas have been proposed. One of them is a combination of RMC with the abstract-check-refine paradigm yielding the so-called abstract regular model checking (ARMC). ARMC has originally been proposed for word automata and transducers only and thus for dealing with systems with linear (or easily linearisable) structure. In this paper, we propose a generalisation of ARMC to the case of dealing with trees which arise naturally in a lot of modelling and verification contexts. In particular, we first propose abstractions of tree automata based on collapsing their states having an equal language of trees up to some bounded height. Then, we propose an abstraction based on collapsing states having a non-empty intersection (and thus ``satisfying'') the same bottom-up tree ``predicate'' languages. Finally, we show on several examples that the methods we propose give us very encouraging verification results.