Skip to main content
Download book PDF
View expanded cover

International Conference on Tools and Algorithms for the Construction and Analysis of Systems

TACAS 2013: Tools and Algorithms for the Construction and Analysis of Systems pp 627–629Cite as

Predator: A Tool for Verification of Low-Level List Manipulation

(Competition Contribution)

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7795)

Abstract

Predator is a tool for automated formal verification of sequential C programs operating with pointers and linked lists. The core algorithms of Predator were originally inspired by works on separation logic with higher-order list predicates, but they are now purely graph-based and significantly extended to support various forms of low-level memory manipulation used in system-level code. This paper briefly introduces Predator and describes its participation in the Software Verification Competition SV-COMP’13 held at TACAS’13.

Keywords

  • Separation Logic
  • External Function
  • Dynamic Data Structure
  • Integer Data
  • Coarse Analysis

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This work was supported by the Czech Science Foundation (project P103/10/0306), the Czech Ministry of Education (project MSM 0021630528), the BUT projects FIT-S-11-1 and FIT-S-12-1, and the EU/Czech IT4Innovations Centre of Excellence project CZ.1.05/1.1.00/02.0070.

Download conference paper PDF

References

  1. Berdine, J., Calcagno, C., Cook, B., Distefano, D., O’Hearn, P.W., Wies, T., Yang, H.: Shape Analysis for Composite Data Structures. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 178–192. Springer, Heidelberg (2007)

    CrossRef  Google Scholar 

  2. 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)

    CrossRef  Google Scholar 

  3. Dudka, K., Peringer, P., Vojnar, T.: Byte-Precise Verification of Low-Level List Manipulation. Technical Report No. FIT-TR-2012-04, FIT BUT (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IT4Innovations Centre of Excellence, FIT, Brno University of Technology, Czech Republic

    Kamil Dudka, Petr Müller, Petr Peringer & Tomáš Vojnar

Authors
  1. Kamil Dudka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Petr Müller
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Petr Peringer
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tomáš Vojnar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK

    Nir Piterman

  2. Department of Computer Science, State University of New York at Stony Brook, 11794-4400, Stony Brook, NY, USA

    Scott A. Smolka

Rights and permissions

Reprints and Permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dudka, K., Müller, P., Peringer, P., Vojnar, T. (2013). Predator: A Tool for Verification of Low-Level List Manipulation. In: Piterman, N., Smolka, S.A. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2013. Lecture Notes in Computer Science, vol 7795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36742-7_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36742-7_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36741-0

  • Online ISBN: 978-3-642-36742-7

  • eBook Packages: Computer ScienceComputer Science (R0)