Detail publikace

Verification of heap manipulating programs with ordered data by extended forest automata

Originální název

Verification of heap manipulating programs with ordered data by extended forest automata

Anglický název

Verification of heap manipulating programs with ordered data by extended forest automata

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

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",
  annote="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.",
  address="NEUVEDEN",
  chapter="119864",
  doi="10.1007/s00236-015-0235-0",
  edition="NEUVEDEN",
  howpublished="print",
  institution="NEUVEDEN",
  number="4",
  volume="53",
  year="2015",
  month="may",
  pages="357--385",
  publisher="NEUVEDEN",
  type="journal article in Web of Science"
}