Publication Details

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. Verification of heap manipulating programs with ordered data by extended forest automata. Acta Informatica, 2015, vol. 53, no. 4, p. 357-385. ISSN: 0001-5903.
Czech title
Použití rozšířených lesních automatů pro verifikaci programů manipulujících s haldou s uspořádáním nad datovými elementy
Type
journal article
Language
English
Authors
Holík Lukáš, doc. Mgr., Ph.D. (DITS)
Lengál Ondřej, Ing., Ph.D. (DITS)
Vojnar Tomáš, prof. Ing., Ph.D. (DITS)
Jonsson Bengt
Trinh Quy Cong
Abdulla Parosh
URL
Keywords

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

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.

Published
2015
Pages
357–385
Journal
Acta Informatica, vol. 53, no. 4, ISSN 0001-5903
DOI
10.1007/s00236-015-0235-0
UT WoS
000376978100003
EID Scopus
2-s2.0-84928978668
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"
}
Back to top