Publication detail

Verification of heap manipulating programs with ordered data by extended forest automata

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

Original Title

Verification of heap manipulating programs with ordered data by extended forest automata

Type

journal article in Web of Science

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. The underlying formalism of our framework is that of forest automata (FA), which has previously been developed for verification of heap-manipulating programs. We extend FA with constraints between data elements associated with nodes of the heaps represented by FA, and we present extended versions of all operations needed for using 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 successfully 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.

Keywords

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

Authors

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

RIV year

2015

Released

25. 5. 2015

ISBN

0001-5903

Periodical

Acta Informatica

Year of study

53

Number

4

State

Federal Republic of Germany

Pages from

357

Pages to

385

Pages count

29

URL

http://link.springer.com/article/10.1007%2Fs00236-015-0235-0

BibTex

@article{BUT119864,
  author="Lukáš {Holík} and Ondřej {Lengál} and Tomáš {Vojnar} and Bengt {Jonsson} and Quy Cong {Trinh} and Parosh {Abdulla}",
  title="Verification of heap manipulating programs with ordered data by extended forest automata",
  journal="Acta Informatica",
  year="2015",
  volume="53",
  number="4",
  pages="357--385",
  doi="10.1007/s00236-015-0235-0",
  issn="0001-5903",
  url="http://link.springer.com/article/10.1007%2Fs00236-015-0235-0"
}