Publication detail

Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata

HOLÍK, L. JONSSON, B. LENGÁL, O. VOJNAR, T. TRINH, Q. ABDULLA, P.

Original Title

Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata

Type

article in a collection out of WoS and Scopus

Language

English

Original Abstract

We present a general framework for verifying programs with complex dynamic linked data structures whose correctness depends on ordering relations between stored data values. Our framework is based on the notion of forest automata (FA) previously developed for verification of heap-manipulating programs. We extend FA by constraints between data elements associated with nodes of the heaps represented by FA, and we propose necessary modifications of all the operations needed for a use of the extended FA in a fully-automated verification approach, based on abstract interpretation. We have implemented our approach as an extension of the Forester tool, and applied it to a number of programs dealing with data structures such as various forms of singly- and doubly-linked lists, binary search trees, as well as skip lists. The experiments show that our approach is not only fully automated, rather general, but also quite efficient.

Keywords

forest automata, shape analysis, dynamic linked data structures,tree automata, abstraction

Authors

HOLÍK, L.; JONSSON, B.; LENGÁL, O.; VOJNAR, T.; TRINH, Q.; ABDULLA, P.

RIV year

2013

Released

26. 10. 2013

Publisher

Springer Verlag

Location

Heidelberg

ISBN

978-3-319-02443-1

Book

Proceedings of ATVA'13

Pages from

224

Pages to

239

Pages count

15

BibTex

@inproceedings{BUT103527,
  author="Lukáš {Holík} and Bengt {Jonsson} and Ondřej {Lengál} and Tomáš {Vojnar} and Quy Cong {Trinh} and Parosh {Abdulla}",
  title="Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata",
  booktitle="Proceedings of ATVA'13",
  year="2013",
  pages="224--239",
  publisher="Springer Verlag",
  address="Heidelberg",
  isbn="978-3-319-02443-1"
}