Run Forester, Run Backwards!
This paper briefly describes the Forester tree automata-based shape analyser and its participation in the SV-COMP’16 competition on software verification. In particular, it summarizes the verification approach used by Forester, its architecture and setup for the competition, as well as its strengths and weaknesses observed in the competition run. The paper highlights the newly added counterexample validation and use of refinable predicate language abstraction.
This work was supported by the Czech Science Foundation under the project 14-11384S. Martin Hruška is a holder of the Brno Ph.D. Talent Scholarship, funded by the Brno City Municipality.
- 6.Hruška, M.: Verification of pointer programs based on forest automata, MSc. thesis, Brno University of Technology (2015)Google Scholar