Faculty of Information Technology, BUT

Publication Details

Automata-based Verification of Programs with Tree Updates

HABERMEHL Peter, IOSIF Radu and VOJNAR Tomáš. Automata-based Verification of Programs with Tree Updates. Verimag Technical Report number TR-2005-16, Grenoble: VERIMAG, 2005.
Czech title
Verifikace programů manipulujících stromové struktury s využitím teorie automatů
Type
technical report
Language
english
Authors
Habermehl Peter (UPAR7)
Iosif Radu (VERIMAG)
Vojnar Tomáš, prof. Ing., Ph.D. (DITS FIT BUT)
Keywords
formal verification, symbolic methods, automata theory, tree automata, automata with constraints
Abstract
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is undecidable, we appeal to a classical semi-algorithmic approach in which the user has to provide manually the loop invariants in order to check the validity of Hoare triples of the form $\{P\}C\{Q\}$, where $P, Q$ are the sets of states corresponding to the pre- and post-conditions, and $C$ is the program to be verified. We specify the sets of states (representing tree-like memory configurations) using  a special class of tree automata named Tree Automata with Size Constraints (TASC). The main advantage of using TASC in program specifications is that they recognize non-regular sets of tree languages such as the {\em AVL trees}, the  {\em red-black trees}, and in general, specifications involving arithmetic reasoning about the lengths (depths) of various (possibly all) paths in the tree. The class of TASC is closed under the operations of union, intersection and complement, and moreover, the emptiness problem is decidable, which makes it a practical verification tool. We validate our approach considering red-black trees and the insertion procedure, for which we verify that the output of the insertion algorithm is a {\em balanced} red-black tree, i.e. the longest path is at most twice as long as the shortest path.
Published
2005
Pages
28
Publisher
VERIMAG
Place
Verimag Technical Report number TR-2005-16, Grenoble, FR
BibTeX
@TECHREPORT{FITPUB7958,
   author = "Peter Habermehl and Radu Iosif and Tom\'{a}\v{s} Vojnar",
   title = "Automata-based Verification of Programs with Tree Updates",
   pages = 28,
   year = 2005,
   location = "Verimag Technical Report number TR-2005-16, Grenoble, FR",
   publisher = "VERIMAG",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/7958"
}
Back to top