Detail publikace

Optimized PredatorHP and the SV-COMP Heap and Memory Safety Benchmark (Competition Contribution)

KOTOUN, M. PERINGER, P. ŠOKOVÁ, V. VOJNAR, T.

Originální název

Optimized PredatorHP and the SV-COMP Heap and Memory Safety Benchmark (Competition Contribution)

Typ

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

Jazyk

angličtina

Originální abstrakt

This paper describes shortly the PredatorHP (Predator Hunting Party) analyzer and its participation in the SV-COMP 2016 software verification competition. The paper starts by a brief sketch of the Predator shape analyzer on which PredatorHP is built, using multiple, concurrently running, specialised instances of Predator. The paper explains why the concrete mix of the different Predators was used, based on some characteristics of the SV-COMP  benchmark.

Klíčová slova

formal verification, program analysis, shape analysis, symbolic memory graphs, bug hunting, memory safety, software verification competition

Autoři

KOTOUN, M.; PERINGER, P.; ŠOKOVÁ, V.; VOJNAR, T.

Vydáno

2. 4. 2016

Nakladatel

Springer Verlag

Místo

Heidelberg

ISBN

978-3-662-49673-2

Kniha

Proceedings of TACAS 2016

Edice

Lecture Notes in Computer Science

Strany od

942

Strany do

945

Strany počet

4

URL

http://link.springer.com/chapter/10.1007%2F978-3-662-49674-9_66

BibTex

@inproceedings{BUT130970,
  author="Michal {Kotoun} and Petr {Peringer} and Veronika {Šoková} and Tomáš {Vojnar}",
  title="Optimized PredatorHP and the SV-COMP Heap and Memory Safety Benchmark (Competition Contribution)",
  booktitle="Proceedings of TACAS 2016",
  year="2016",
  series="Lecture Notes in Computer Science",
  volume="9636",
  pages="942--945",
  publisher="Springer Verlag",
  address="Heidelberg",
  doi="10.1007/978-3-662-49674-9\{_}66",
  isbn="978-3-662-49673-2",
  url="http://link.springer.com/chapter/10.1007%2F978-3-662-49674-9_66"
}