Publication detail

Predator: A Practical Tool for Checking Manipulation of Dynamic Data Structures Using Separation Logic

DUDKA, K. PERINGER, P. VOJNAR, T.

Original Title

Predator: A Practical Tool for Checking Manipulation of Dynamic Data Structures Using Separation Logic

Type

report

Language

English

Original Abstract

Predator is a new open source tool for verification of sequential C programs with dynamic linked data structures. The tool is conceptually based on separation logic with inductive predicates despite it uses a graph description of heaps. Predator currently handles various forms of lists, including singly-linked as well as doubly-linked lists that may be circular, hierarchically nested and that may have various additional pointer links. Predator is implemented as a gcc plug-in and it is capable of handling lists in the form they appear in real system code, especially the Linux kernel, including a limited support of pointer arithmetic. Collaboration on further development of Predator is welcome.

Keywords

separation logic, shape analysis, dynamic linked data structures, pointers, linked lists, tool support, formal verification, Linux lists

Authors

DUDKA, K.; PERINGER, P.; VOJNAR, T.

Released

16. 7. 2011

Publisher

Faculty of Information Technology BUT

Location

FIT-TR-2011-02, Brno

Pages count

23

URL

http://www.fit.vutbr.cz/research/groups/verifit/tools/predator/FIT-TR-2011-02.pdf

BibTex

@techreport{BUT192766,
  author="Kamil {Dudka} and Petr {Peringer} and Tomáš {Vojnar}",
  title="Predator: A Practical Tool for Checking Manipulation of Dynamic Data Structures Using Separation Logic",
  year="2011",
  publisher="Faculty of Information Technology BUT",
  address="FIT-TR-2011-02, Brno",
  pages="23",
  url="http://www.fit.vutbr.cz/research/groups/verifit/tools/predator/FIT-TR-2011-02.pdf"
}