Publication Details

Run Forester, Run Backwards! (Competition Contribution)

HRUŠKA, M.; LENGÁL, O.; ŠIMÁČEK, J.; VOJNAR, T.; HOLÍK, L.; ROGALEWICZ, A. Run Forester, Run Backwards! (Competition Contribution). In Proceedings of TACAS'16. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2016. p. 923-926. ISBN: 978-3-662-49673-2.
Czech title
Utíkej Lesníku, utíkej pozpátku! (soutěžní příspěvěk)
Type
conference paper
Language
English
Authors
URL
Keywords

program verification forest automata shape analysis memory safety heap manipulation dynamic data structures backward run predicate abstraction

Abstract

Forester is a tool for shape analysis of programs with complex dynamic data structures, including various flavours of lists (such as singly linked lists, nested lists, or skip lists) as well as trees, that uses an abstract domain based on finite tree automata. This paper gives a  brief description of the verification approach of Forester, the newly implemented backward run and predicate abstraction and discusses its strong and weak points revealed during its participation in SV-COMP'16.

Published
2016
Pages
923–926
Proceedings
Proceedings of TACAS'16
Series
Lecture Notes in Computer Science
Volume
9636
ISBN
978-3-662-49673-2
Publisher
Springer Verlag
Place
Heidelberg
DOI
UT WoS
000406428000061
EID Scopus
BibTeX
@inproceedings{BUT130969,
  author="Martin {Hruška} and Ondřej {Lengál} and Jiří {Šimáček} and Tomáš {Vojnar} and Lukáš {Holík} and Adam {Rogalewicz}",
  title="Run Forester, Run Backwards! (Competition Contribution)",
  booktitle="Proceedings of TACAS'16",
  year="2016",
  series="Lecture Notes in Computer Science",
  volume="9636",
  pages="923--926",
  publisher="Springer Verlag",
  address="Heidelberg",
  doi="10.1007/978-3-662-49674-9\{_}61",
  isbn="978-3-662-49673-2",
  url="http://www.springer.com/us/book/9783662496732"
}
Back to top