Publication Details

Forester: Shape Analysis Using Tree Automata (Competition Contribution)

HRUŠKA, M.; LENGÁL, O.; ŠIMÁČEK, J.; VOJNAR, T.; HOLÍK, L.; ROGALEWICZ, A. Forester: Shape Analysis Using Tree Automata (Competition Contribution). In Proceedings of TACAS'15. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2015. p. 432-435. ISBN: 978-3-662-46680-3.
Czech title
Lesník: Analýza haldy pomocí stromových automatů (soutěžní příspěvek)
Type
conference paper
Language
English
Authors
Hruška Martin, Ing., Ph.D. (Automata@FIT)
Lengál Ondřej, Ing., Ph.D. (DITS)
Šimáček Jiří, Ing., Ph.D.
Vojnar Tomáš, prof. Ing., Ph.D. (DITS)
Holík Lukáš, doc. Mgr., Ph.D. (DITS)
Rogalewicz Adam, doc. Mgr., Ph.D. (DITS)
URL
Keywords

program verification forest automata shape analysis memory safety heap manipulation dynamic data structures

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 and discusses its strong and weak points revealed during its participation in SV-COMP'15.

Published
2015
Pages
432–435
Proceedings
Proceedings of TACAS'15
Series
Lecture Notes in Computer Science
Volume
9035
ISBN
978-3-662-46680-3
Publisher
Springer Verlag
Place
Heidelberg
DOI
10.1007/978-3-662-46681-0_37
EID Scopus
2-s2.0-84926666987
BibTeX 
@inproceedings{BUT119807,
  author="Martin {Hruška} and Ondřej {Lengál} and Jiří {Šimáček} and Tomáš {Vojnar} and Lukáš {Holík} and Adam {Rogalewicz}",
  title="Forester: Shape Analysis Using Tree Automata (Competition Contribution)",
  booktitle="Proceedings of TACAS'15",
  year="2015",
  series="Lecture Notes in Computer Science",
  volume="9035",
  pages="432--435",
  publisher="Springer Verlag",
  address="Heidelberg",
  doi="10.1007/978-3-662-46681-0\{_}37",
  isbn="978-3-662-46680-3",
  url="http://dx.doi.org/10.1007/978-3-662-46681-0_37"
}
Back to top