Publication Details
Counterexample Analysis in Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
Formal verification, Regular tree model checking, shape analysis,
We focus in details on the use of abstract regular tree model checking (ARTMC) within a successful method for verification of programs with dynamic data structures. The method is based on a use of a set of transducers to describe the behaviour of the verified system. But the ARTMC method was originally developed for systems of one transducer only and its generalization to several ones was supposed to be straightforward. Although this straightforward generalization (used in a prototype implementation) works well in a number of examples, the counterexample analysis is in general unreliable and can cause infinite looping of the tool as we demonstrate on a simple example containing an erroneous pointer manipulation. Therefore we propose a new algorithm used for a counterexample analysis and we prove its correctness.
@INPROCEEDINGS{FITPUB8521, author = "Luk\'{a}\v{s} Hol\'{i}k and Adam Rogalewicz", title = "Counterexample Analysis in Abstract Regular Tree Model Checking of Complex Dynamic Data Structures", pages = "59--66", booktitle = "Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2007)", year = 2007, location = "Znojmo, CZ", publisher = "Ing. Zden\v{e}k Novotn\'{y}, CSc.", ISBN = "978-80-7355-077-6", language = "english", url = "https://www.fit.vut.cz/research/publication/8521" }