Verification of heap manipulating programs with ordered data by extended forest automata
2016 (English)In: Acta Informatica, ISSN 0001-5903, E-ISSN 1432-0525, Vol. 53, no 4, 357-385 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
2016. Vol. 53, no 4, 357-385 p.
IdentifiersURN: urn:nbn:se:uu:diva-295451DOI: 10.1007/s00236-015-0235-0ISI: 000376978100003OAI: oai:DiVA.org:uu-295451DiVA: diva2:933735
FunderSwedish Foundation for Strategic Research