Forester: From Heap Shapes to Automata Predicates - (Competition Contribution)

This paper describes the participation of Forester in the SV-COMP 2017 competition on software verification. We briefly present the verification procedure used by Forester, the architecture of Forester, and changes in Forester done since the previous year of SV-COMP, in particular the fully-automatically refinable abstraction for hierarchical forest automata.

[1]  Edmund M. Clarke,et al.  Counterexample-guided abstraction refinement , 2003, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings..

[2]  Ahmed Bouajjani,et al.  Abstract regular (tree) model checking , 2012, International Journal on Software Tools for Technology Transfer.

[3]  Tomás Vojnar,et al.  VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata , 2012, TACAS.

[4]  Lukás Holík,et al.  Fully Automated Shape Analysis Based on Forest Automata , 2013, CAV.

[5]  Lukás Holík,et al.  Run Forester, Run Backwards! - (Competition Contribution) , 2016, TACAS.

[6]  Tomás Vojnar,et al.  An Easy to Use Infrastructure for Building Static Analysis Tools , 2011, EUROCAST.

[7]  Lukás Holík,et al.  Counterexample Validation and Interpolation-Based Refinement for Forest Automata , 2017, VMCAI.

[8]  Lukás Holík,et al.  Forest Automata for Verification of Heap Manipulation , 2011, CAV.