Predator: A Tool for Verification of Low-Level List Manipulation
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.
KeywordsSeparation Logic External Function Dynamic Data Structure Integer Data Coarse Analysis
Unable to display preview. Download preview PDF.
- 3.Dudka, K., Peringer, P., Vojnar, T.: Byte-Precise Verification of Low-Level List Manipulation. Technical Report No. FIT-TR-2012-04, FIT BUT (2012)Google Scholar