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

journal article - other

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.

RIV year

2011

Released

16. 7. 2011

ISBN

0302-9743

Periodical

Lecture Notes in Computer Science

Year of study

2011

Number

6806

State

Federal Republic of Germany

Pages from

372

Pages to

378

Pages count

6

URL

http://www.springerlink.com/content/0348r4140k031426/

BibTex

@article{BUT76288,
  author="Kamil {Dudka} and Petr {Peringer} and Tomáš {Vojnar}",
  title="Predator: A Practical Tool for Checking Manipulation of Dynamic Data Structures Using Separation Logic",
  journal="Lecture Notes in Computer Science",
  year="2011",
  volume="2011",
  number="6806",
  pages="372--378",
  issn="0302-9743",
  url="http://www.springerlink.com/content/0348r4140k031426/"
}