Publication detail

Run Forester, Run Backwards! (Competition Contribution)

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

Original Title

Run Forester, Run Backwards! (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, the newly implemented backward run and predicate abstraction and discusses its strong and weak points revealed during its participation in SV-COMP'16.

Keywords

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

Authors

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

Released

8. 4. 2016

Publisher

Springer Verlag

Location

Heidelberg

ISBN

978-3-662-49673-2

Book

Proceedings of TACAS'16

Edition

Lecture Notes in Computer Science

Pages from

923

Pages to

926

Pages count

4

URL

http://www.springer.com/us/book/9783662496732

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