Publication Details

Counterexample Validation and Interpolation-Based Refinement for Forest Automata

HRUŠKA, M.; HOLÍK, L.; LENGÁL, O.; ROGALEWICZ, A.; VOJNAR, T. Counterexample Validation and Interpolation-Based Refinement for Forest Automata. Brno: Faculty of Information Technology BUT, 2017. p. 1-23.
Czech title
Ověřování protipříkladů a zjemňovaní abstrakce založené na interpolantech pro lesní automaty
Type
report
Language
English
Authors
Hruška Martin, Ing., Ph.D. (Automata@FIT)
Holík Lukáš, doc. Mgr., Ph.D. (DITS)
Lengál Ondřej, Ing., Ph.D. (DITS)
Rogalewicz Adam, doc. Mgr., Ph.D. (DITS)
Vojnar Tomáš, prof. Ing., Ph.D. (DITS)
Keywords

program analysis, shape analysis, counterexample validation, abstraction refinement, forest automata, tree automata

Abstract

In the context of shape analysis, counterexample validation and abstraction refinement are complex and so far not sufficiently resolved problems. We provide a novel solution to both of these problems in the context of fully automated and rather general shape analysis based on forest automata. Our approach is based on backward symbolic execution on forest automata, allowing one to derive automata-based interpolants and refine the automata abstraction used. The approach allows one to distinguish true and spurious counterexamples and guarantees progress of the abstraction refinement. We have implemented the approach in the FORESTER tool and present promising experimental results. http://www.fit.vutbr.cz/~lengal/pub/FIT-TR-2016-03.pdf

Published
2017
Pages
1–23
Publisher
Faculty of Information Technology BUT
Place
Brno
BibTeX 
@techreport{BUT170108,
  author="Martin {Hruška} and Lukáš {Holík} and Ondřej {Lengál} and Adam {Rogalewicz} and Tomáš {Vojnar}",
  title="Counterexample Validation and Interpolation-Based Refinement for Forest Automata",
  year="2017",
  publisher="Faculty of Information Technology BUT",
  address="Brno",
  pages="1--23"
}
Back to top