We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Verification of heap manipulating programs with ordered data by extended forest automata.
- Authors
Abdulla, Parosh; Holík, Lukáš; Jonsson, Bengt; Lengál, Ondřej; Trinh, Cong; Vojnar, Tomáš
- 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.
- Subjects
MACHINE theory; COMPUTER software correctness; BINARY number system; MANIPULATION checks (Research); HEAPS (Mathematics)
- Publication
Acta Informatica, 2016, Vol 53, Issue 4, p357
- ISSN
0001-5903
- Publication type
Article
- DOI
10.1007/s00236-015-0235-0