Přístupnostní navigace
E-application
Search Search Close
Publication detail
HOLÍK, L. ROGALEWICZ, A.
Original Title
Counterexample Analysis in Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
Type
article in a collection out of WoS and Scopus
Language
English
Original Abstract
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.
Keywords
Formal verification, Regular tree model checking, shape analysis,
Authors
HOLÍK, L.; ROGALEWICZ, A.
RIV year
2007
Released
26. 10. 2007
Publisher
Ing. Zdeněk Novotný, CSc.
Location
Znojmo
ISBN
978-80-7355-077-6
Book
Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2007)
Pages from
59
Pages to
66
Pages count
8
URL
http://www.fit.vutbr.cz/~rogalew/pubs/Memics-2007.pdf
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", url="http://www.fit.vutbr.cz/~rogalew/pubs/Memics-2007.pdf" }