Journal article

ABDULLA Parosh A., HOLÍK Lukáš, JONSSON Bengt, LENGÁL Ondřej, TRINH Quy Cong and VOJNAR Tomáš. Verification of heap manipulating programs with ordered data by extended forest automata. Acta Informatica. 2015, vol. 53, no. 4, pp. 357-385. ISSN 0001-5903. Available from:
Publication language:english
Original title:Verification of heap manipulating programs with ordered data by extended forest automata
Title (cs):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
Journal:Acta Informatica, Vol. 53, No. 4, DE
forest automata, shape analysis, dynamic linked data structures,tree automata, abstraction
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.
   author = {A. Parosh Abdulla and Luk{\'{a}}{\v{s}}
	Hol{\'{i}}k and Bengt Jonsson and Ond{\v{r}}ej
	Leng{\'{a}}l and Cong Quy Trinh and
	Tom{\'{a}}{\v{s}} Vojnar},
   title = {Verification of heap manipulating programs with
	ordered data by extended forest automata},
   pages = {357--385},
   journal = {Acta Informatica},
   volume = 53,
 number = 4,
   year = 2015,
   ISSN = {0001-5903},
   doi = {10.1007/s00236-015-0235-0},
   language = {english},
   url = {}

Your IPv4 address:
Switch to https