Predator: A Tool for Verification of Low-Level List Manipulation - (Competition Contribution)
暂无分享,去创建一个
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.
[1] Peter W. O'Hearn,et al. Shape Analysis for Composite Data Structures , 2007, CAV.
[2] Tomás Vojnar,et al. Predator: A Practical Tool for Checking Manipulation of Dynamic Data Structures Using Separation Logic , 2011, CAV.
[3] Tomás Vojnar,et al. Byte-Precise Verification of Low-Level List Manipulation , 2013, SAS.