Conference paper

HOLÍK Lukáš, HRUŠKA Martin, LENGÁL Ondřej, ROGALEWICZ Adam, ŠIMÁČEK Jiří and VOJNAR Tomáš. Forester: Shape Analysis Using Tree Automata (Competition Contribution). In: Proceedings of TACAS'15. Heidelberg: Springer Verlag, 2015, pp. 431-434. ISBN 978-3-662-46680-3. Available from:
Publication language:english
Original title:Forester: Shape Analysis Using Tree Automata (Competition Contribution)
Title (cs):Lesník: Analýza haldy pomocí stromových automatů (soutěžní příspěvek)
Proceedings:Proceedings of TACAS'15
Conference:European Joint Conferences on Theory and Practice of Software -- ETAPS'15 (TACAS'15)
Series:LNCS 9035
Place:Heidelberg, DE
Publisher:Springer Verlag
program verification
forest automata
shape analysis
memory safety
heap manipulation
dynamic data structures
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.
   author = {Luk{\'{a}}{\v{s}} Hol{\'{i}}k and Martin
	Hru{\v{s}}ka and Ond{\v{r}}ej Leng{\'{a}}l and
	Adam Rogalewicz and Ji{\v{r}}{\'{i}}
	{\v{S}}im{\'{a}}{\v{c}}ek and Tom{\'{a}}{\v{s}}
   title = {Forester: Shape Analysis Using Tree Automata
	(Competition Contribution)},
   pages = {431--434},
   booktitle = {Proceedings of TACAS'15},
   series = {LNCS 9035},
   year = 2015,
   location = {Heidelberg, DE},
   publisher = {Springer Verlag},
   ISBN = {978-3-662-46680-3},
   doi = {10.1007/978-3-662-46681-0_37},
   language = {english},
   url = {}

Your IPv4 address:
Switch to https