Advertisement

Run Forester, Run Backwards!

(Competition Contribution)
  • Lukáš Holík
  • Martin Hruška
  • Ondřej Lengál
  • Adam Rogalewicz
  • Jiří Šimáček
  • Tomáš Vojnar
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9636)

Abstract

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.

Notes

Acknowledgement

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.

References

  1. 1.
    Habermehl, P., Holík, L., Rogalewicz, A., Šimáček, J., Vojnar, T.: Forest automata for verification of heap manipulation. Formal Methods Syst. Des. 41(1), 83–106 (2012). SpringerCrossRefMATHGoogle Scholar
  2. 2.
    Holík, L., Lengál, O., Rogalewicz, A., Šimáček, J., Vojnar, T.: Fully automated shape analysis based on forest automata. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 740–755. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  3. 3.
    Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract regular (tree) model checking. Int. J. Softw. Tools Technol. Transfer 14(2), 167–191 (2012). SpringerCrossRefMATHGoogle Scholar
  4. 4.
    Dudka, K., Peringer, P., Vojnar, T.: An easy to use infrastructure for building static analysis tools. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) EUROCAST 2011, Part I. LNCS, vol. 6927, pp. 527–534. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  5. 5.
    Lengál, O., Šimáček, J., Vojnar, T.: VATA: a library for efficient manipulation of non-deterministic tree automata. In: Flanagan, C., König, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 79–94. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  6. 6.
    Hruška, M.: Verification of pointer programs based on forest automata, MSc. thesis, Brno University of Technology (2015)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  • Lukáš Holík
    • 1
  • Martin Hruška
    • 1
  • Ondřej Lengál
    • 2
  • Adam Rogalewicz
    • 1
  • Jiří Šimáček
    • 1
  • Tomáš Vojnar
    • 1
  1. 1.FIT, Brno University of Technology, IT4Innovations Centre of ExcellenceBrnoCzech Republic
  2. 2.Institute of Information ScienceAcademia SinicaTaipeiTaiwan

Personalised recommendations