Predator: A Verification Tool for Programs with Dynamic Linked Data Structures

(Competition Contribution)
  • Kamil Dudka
  • Petr Müller
  • Petr Peringer
  • Tomáš Vojnar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7214)

Abstract

Predator is a tool for automated formal verification of sequential C programs with dynamic linked data structures. It is in principle based on separation logic, but uses a graph-based heap representation. This paper first provides a brief overview of Predator and then discusses experience with its participation in the Software Verification Competition of TACAS’12.

References

  1. 1.
    Dudka, K., Peringer, P., Vojnar, T.: Predator: A Practical Tool for Checking Manipulation of Dynamic Data Structures Using Separation Logic. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 372–378. Springer, Heidelberg (2011)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Kamil Dudka
    • 1
  • Petr Müller
    • 1
  • Petr Peringer
    • 1
  • Tomáš Vojnar
    • 1
  1. 1.IT4Innovations Centre of ExcellenceFIT, Brno University of TechnologyCzech Republic

Personalised recommendations