Publication Details
Predator: A Shape Analyzer Based on Symbolic Memory Graphs (Competition Contribution)
DUDKA, K.; PERINGER, P.; VOJNAR, T. Predator: A Shape Analyzer Based on Symbolic Memory Graphs (Competition Contribution). In Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2014. p. 412-414. ISBN: 978-3-642-54861-1.
Czech title
Predator: analyzátor tvaru založený na symbolických grafech paměti (soutěžní příspěvek)
Type
conference paper
Language
English
Authors
URL
Keywords
dynamic linked data structures
separation logic
symbolic memory graphs
list manipulation
low-level memory manipulation
memory safety
shape analysis
Abstract
Predator is a shape analyzer that uses the abstract domain of symbolicmemory graphs in order to support various forms of low-level memory manipulation commonly used in optimized C code. This paper briefly describes the verification approach taken by Predator and its strengths and weaknesses revealed during its participation in the Software Verification Competition (SV-COMP14).
Published
2014
Pages
412–414
Proceedings
Tools and Algorithms for the Construction and Analysis of Systems
Series
Lecture Notes in Computer Science
Volume
8413
Conference
European Joint Conferences on Theory and Practice of Software -- ETAPS'14 (TACAS'14), Grenoble, FR
ISBN
978-3-642-54861-1
Publisher
Springer Verlag
Place
Heidelberg
DOI
EID Scopus
BibTeX
@inproceedings{BUT111526,
author="Kamil {Dudka} and Petr {Peringer} and Tomáš {Vojnar}",
title="Predator: A Shape Analyzer Based on Symbolic Memory Graphs (Competition Contribution)",
booktitle="Tools and Algorithms for the Construction and Analysis of Systems",
year="2014",
series="Lecture Notes in Computer Science",
volume="8413",
pages="412--414",
publisher="Springer Verlag",
address="Heidelberg",
doi="10.1007/978-3-642-54862-8\{_}33",
isbn="978-3-642-54861-1",
url="http://link.springer.com/chapter/10.1007/978-3-642-54862-8_33"
}