Faculty of Information Technology, BUT

Publication Details

Forest Automata for Verification of Heap Manipulation

HABERMEHL Peter, HOLÍK Lukáš, ROGALEWICZ Adam, ŠIMÁČEK Jiří and VOJNAR Tomáš. Forest Automata for Verification of Heap Manipulation. Formal Methods in System Design, vol. 2012, no. 41, pp. 83-106. ISSN 0925-9856. Available from: http://www.springerlink.com/content/p14x123477v1r722/
Czech title
Automaty nad lesy pro verifikaci programů s dynamickými datovými strukturami
Type
journal article
Language
english
Authors
Habermehl Peter (UPAR7)
Holík Lukáš, Mgr., Ph.D. (DITS FIT BUT)
Rogalewicz Adam, doc. Mgr., Ph.D. (DITS FIT BUT)
Šimáček Jiří, Ing., Ph.D. (DITS FIT BUT)
Vojnar Tomáš, prof. Ing., Ph.D. (DITS FIT BUT)
URL
Keywords
shape analysis, dynamic linked data structures, tree automata, trees, linked lists, formal verification, abstract regular model checking
Abstract
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.
Published
2012
Pages
83-106
Journal
Formal Methods in System Design, vol. 2012, no. 41, ISSN 0925-9856
Publisher
Springer Verlag
DOI
BibTeX
@ARTICLE{FITPUB10013,
   author = "Peter Habermehl and Luk\'{a}\v{s} Hol\'{i}k and Adam Rogalewicz and Ji\v{r}\'{i} \v{S}im\'{a}\v{c}ek and Tom\'{a}\v{s} Vojnar",
   title = "Forest Automata for Verification of Heap Manipulation",
   pages = "83--106",
   journal = "Formal Methods in System Design",
   volume = 2012,
   number = 41,
   year = 2012,
   ISSN = "0925-9856",
   doi = "10.1007/s10703-012-0150-8",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/10013"
}
Back to top