Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikace
HOLÍK, L. ROGALEWICZ, A.
Originální název
Counterexample Analysis in Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
Typ
článek ve sborníku ve WoS nebo Scopus
Jazyk
angličtina
Originální abstrakt
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.
Klíčová slova
Formal verification, Regular tree model checking, shape analysis,
Autoři
HOLÍK, L.; ROGALEWICZ, A.
Rok RIV
2007
Vydáno
26. 10. 2007
Nakladatel
Ing. Zdeněk Novotný, CSc.
Místo
Znojmo
ISBN
978-80-7355-077-6
Kniha
Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2007)
Strany od
59
Strany do
66
Strany počet
8
BibTex
@inproceedings{BUT25361, author="Lukáš {Holík} and Adam {Rogalewicz}", title="Counterexample Analysis in Abstract Regular Tree Model Checking of Complex Dynamic Data Structures", booktitle="Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2007)", year="2007", pages="59--66", publisher="Ing. Zdeněk Novotný, CSc.", address="Znojmo", isbn="978-80-7355-077-6" }