Detail publikace

Predator: A Shape Analyzer Based on Symbolic Memory Graphs (Competition Contribution)

DUDKA, K. PERINGER, P. VOJNAR, T.

Originální název

Predator: A Shape Analyzer Based on Symbolic Memory Graphs (Competition Contribution)

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

Originální abstrakt

Predator is a shape analyzer that uses the abstract domain of symbolic memory 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).

Klíčová slova

dynamic linked data structures separation logic symbolic memory graphs list manipulation low-level memory manipulation memory safety shape analysis

Autoři

DUDKA, K.; PERINGER, P.; VOJNAR, T.

Rok RIV

2014

Vydáno

5. 4. 2014

Nakladatel

Springer Verlag

Místo

Heidelberg

ISBN

978-3-642-54861-1

Kniha

Tools and Algorithms for the Construction and Analysis of Systems

Edice

Lecture Notes in Computer Science

Strany od

412

Strany do

414

Strany počet

3

URL

http://link.springer.com/chapter/10.1007/978-3-642-54862-8_33

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"
}