Publication detail

Forester: Shape Analysis Using Tree Automata (Competition Contribution)

HRUŠKA, M. LENGÁL, O. ŠIMÁČEK, J. VOJNAR, T. HOLÍK, L. ROGALEWICZ, A.

Original Title

Forester: Shape Analysis Using Tree Automata (Competition Contribution)

Type

conference paper

Language

English

Original 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.

Keywords

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

Authors

HRUŠKA, M.; LENGÁL, O.; ŠIMÁČEK, J.; VOJNAR, T.; HOLÍK, L.; ROGALEWICZ, A.

RIV year

2015

Released

13. 4. 2015

Publisher

Springer Verlag

Location

Heidelberg

ISBN

978-3-662-46680-3

Book

Proceedings of TACAS'15

Edition

Lecture Notes in Computer Science

Pages from

432

Pages to

435

Pages count

4

URL

http://dx.doi.org/10.1007/978-3-662-46681-0_37

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