Conference paper

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. In: Proceedings of ATVA'13. Heidelberg: Springer Verlag, 2013, pp. 224-239. ISBN 978-3-319-02443-1.
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
Proceedings:Proceedings of ATVA'13
Conference:11th International Symposium on Automated Technology for Verification and Analysis -- ATVA'13, 15th International Workshop on Verification of Infinite-State Systems -- INFINITY'13, 2nd International Workshop on Trends in Tree Automata and Tree Transducers -- TTATT'13
Place:Heidelberg, DE
Publisher:Springer Verlag
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. 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.
   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 = {224--239},
   booktitle = {Proceedings of ATVA'13},
   year = 2013,
   location = {Heidelberg, DE},
   publisher = {Springer Verlag},
   ISBN = {978-3-319-02443-1},
   language = {english},
   url = {}

Your IPv4 address:
Switch to https