Predator: a verification tool for programs with dynamic linked data structures

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'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Year:
2012

Citing 1
Cited 3

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

Competition on software verification

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Linux driver verification

ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: applications and case studies - Volume Part II
Overify: optimizing programs for fast verification

HotOS'13 Proceedings of the 14th USENIX conference on Hot Topics in Operating Systems

Quantified Score

Hi-index	0.00

Visualization

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.