Publication detail

Counterexample Validation and Interpolation-Based Refinement for Forest Automata

HRUŠKA, M. HOLÍK, L. LENGÁL, O. ROGALEWICZ, A. VOJNAR, T.

Original Title

Counterexample Validation and Interpolation-Based Refinement for Forest Automata

Type

report

Language

English

Original 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

Keywords

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

Authors

HRUŠKA, M.; HOLÍK, L.; LENGÁL, O.; ROGALEWICZ, A.; VOJNAR, T.

Released

17. 1. 2017

Publisher

Faculty of Information Technology BUT

Location

Brno

Pages from

1

Pages to

23

Pages count

23

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