Automata-based Verification of Programs with Tree Updates

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F10%3APU89495" target="_blank" >RIV/00216305:26230/10:PU89495 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Automata-based Verification of Programs with Tree Updates

Original language description

This paper, which is an extended version of a paper originally published at TACAS'06, 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&nbsp; 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 <i>AVL trees</i>, the&nbsp; <i>red-black trees</i>, and in general, specifications involving arithmetic reasoning about the lengths (de

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/GA102%2F07%2F0322" target="_blank" >GA102/07/0322: Advanced Formal Approaches in the Design and Verification of Computer-Based Systems</a><br>

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2010

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Acta Informatica

ISSN

0001-5903

e-ISSN

—

Volume of the periodical

47

Issue of the periodical within the volume

1

Country of publishing house

DE - GERMANY

Number of pages

31

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—