Predator: a tool for verification of low-level list manipulation

Authors:
Kamil Dudka;Petr Müller;Petr Peringer;Tomáš Vojnar
Affiliations:
IT4Innovations Centre of Excellence, FIT, Brno University of Technology, Czech Republic;IT4Innovations Centre of Excellence, FIT, Brno University of Technology, Czech Republic;IT4Innovations Centre of Excellence, FIT, Brno University of Technology, Czech Republic;IT4Innovations Centre of Excellence, FIT, Brno University of Technology, Czech Republic
Venue:
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Year:
2013

Citing 2
Cited 2

Shape analysis for composite data structures

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Predator: a practical tool for checking manipulation of dynamic data structures using separation logic

CAV'11 Proceedings of the 23rd international conference on Computer aided verification

Second competition on software verification

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A proof system for separation logic with magic wand

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.00

Visualization

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.