Publication Details

Counterexample Validation and Interpolation-Based Refinement for Forest Automata

HOLÍK, L.; HRUŠKA, M.; LENGÁL, O.; ROGALEWICZ, A.; VOJNAR, T. Counterexample Validation and Interpolation-Based Refinement for Forest Automata. In Proceedings of VMCAI'17. Lecture Notes in Computer Science. Lecture Notes in Computer Science. Cham: Springer Verlag, 2017. p. 288-309. ISBN: 978-3-319-52234-0. ISSN: 0302-9743.
Czech title
Ověřování protipříkladů a zjemňovaní abstrakce založené na interpolantech pro lesní automaty
Type
conference paper
Language
English
Authors
Holík Lukáš, doc. Mgr., Ph.D. (DITS)
Hruška Martin, Ing., Ph.D. (Automata@FIT)
Lengál Ondřej, Ing., Ph.D. (DITS)
Rogalewicz Adam, doc. Mgr., Ph.D. (DITS)
Vojnar Tomáš, prof. Ing., Ph.D. (DITS)
URL
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.

Published
2017
Pages
288–309
Journal
Lecture Notes in Computer Science, vol. 10145, ISSN 0302-9743
Proceedings
Proceedings of VMCAI'17
Series
Lecture Notes in Computer Science
ISBN
978-3-319-52234-0
Publisher
Springer Verlag
Place
Cham
DOI
10.1007/978-3-319-52234-0_16
UT WoS
000413069800016
EID Scopus
2-s2.0-85010702893
BibTeX 
@inproceedings{BUT133502,
  author="Lukáš {Holík} and Martin {Hruška} and Ondřej {Lengál} and Adam {Rogalewicz} and Tomáš {Vojnar}",
  title="Counterexample Validation and Interpolation-Based Refinement for Forest Automata",
  booktitle="Proceedings of VMCAI'17",
  year="2017",
  series="Lecture Notes in Computer Science",
  journal="Lecture Notes in Computer Science",
  volume="10145",
  pages="288--309",
  publisher="Springer Verlag",
  address="Cham",
  doi="10.1007/978-3-319-52234-0\{_}16",
  isbn="978-3-319-52234-0",
  issn="0302-9743",
  url="http://link.springer.com/chapter/10.1007/978-3-319-52234-0_16"
}
Back to top