Detail publikace

Forest Automata for Verification of Heap Manipulation

HOLÍK, L. ROGALEWICZ, A. ŠIMÁČEK, J. VOJNAR, T. HABERMEHL, P.

Originální název

Forest Automata for Verification of Heap Manipulation

Typ

článek v časopise - ostatní, Jost

Jazyk

angličtina

Originální abstrakt

We consider verification of programs manipulating dynamic linked data structures such as various forms of singly and doubly-linked lists or trees. We consider important properties for this kind of systems like no null-pointer dereferences, absence of garbage, shape properties, etc. We develop a verification method based on a novel use of tree automata to represent heap configurations. A heap is split into several "separated" parts such that each of them can be represented by a tree automaton. The automata can refer to each other allowing the different parts of the heaps to mutually refer to their boundaries. Moreover, we allow for a hierarchical representation of heaps by allowing alphabets of the tree automata to contain other, nested tree automata. Program instructions can be easily encoded as operations on our representation structure. This allows verification of programs based on a symbolic state-space exploration together with refinable abstraction within the so-called abstract regular tree model checking. A motivation for the approach is to combine advantages of automata-based approaches (higher generality and flexibility of the abstraction) with some advantages of separation-logic-based approaches (efficiency). We have implemented our approach and tested it successfully on multiple non-trivial case studies.

Klíčová slova

shape analysis, dynamic linked data structures, tree automata, trees, linked lists, formal verification, abstract regular model checking

Autoři

HOLÍK, L.; ROGALEWICZ, A.; ŠIMÁČEK, J.; VOJNAR, T.; HABERMEHL, P.

Rok RIV

2011

Vydáno

16. 7. 2011

ISSN

0302-9743

Periodikum

Lecture Notes in Computer Science

Ročník

2011

Číslo

6806

Stát

Spolková republika Německo

Strany od

424

Strany do

440

Strany počet

16

URL

http://www.springerlink.com/content/408322l43870t177/

BibTex

@article{BUT76287,
  author="Lukáš {Holík} and Adam {Rogalewicz} and Jiří {Šimáček} and Tomáš {Vojnar} and Peter {Habermehl}",
  title="Forest Automata for Verification of Heap Manipulation",
  journal="Lecture Notes in Computer Science",
  year="2011",
  volume="2011",
  number="6806",
  pages="424--440",
  issn="0302-9743",
  url="http://www.springerlink.com/content/408322l43870t177/"
}