Detail publikačního výsledku

Counterexample Analysis in Abstract Regular Tree Model Checking of Complex Dynamic Data Structures

HOLÍK, L.; ROGALEWICZ, A.

Originální název

Counterexample Analysis in Abstract Regular Tree Model Checking of Complex Dynamic Data Structures

Anglický název

Counterexample Analysis in Abstract Regular Tree Model Checking of Complex Dynamic Data Structures

Druh

Stať ve sborníku mimo WoS a Scopus

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 withdynamic data structures. The method is based on a use of a set oftransducers to describe the behaviour of the verified system. But theARTMC method was originally developed for systems of one transduceronly and its generalization to several ones was supposed to bestraightforward. Although this straightforward generalization (used ina prototype  implementation) works well in a number of examples, thecounterexample analysis is in general unreliable and can cause infinitelooping of the tool as we demonstrate on a simple example containing anerroneous pointer manipulation. Therefore we propose a new  algorithmused for a counterexample analysis and we prove its correctness.

Anglický abstrakt

We focus in details on the use of abstract regular tree model checking(ARTMC) within a successful method for verification of programs withdynamic data structures. The method is based on a use of a set oftransducers to describe the behaviour of the verified system. But theARTMC method was originally developed for systems of one transduceronly and its generalization to several ones was supposed to bestraightforward. Although this straightforward generalization (used ina prototype  implementation) works well in a number of examples, thecounterexample analysis is in general unreliable and can cause infinitelooping of the tool as we demonstrate on a simple example containing anerroneous pointer manipulation. Therefore we propose a new  algorithmused for a counterexample analysis and we prove its correctness.

Klíčová slova

Formal verification, Regular tree model checking, shape analysis,

Klíčová slova v angličtině

Formal verification, Regular tree model checking, shape analysis,

Autoři

HOLÍK, L.; ROGALEWICZ, A.

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

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"
}