Forest Automata for Verification of Heap Manipulation

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F12%3APU101788" target="_blank" >RIV/00216305:26230/12:PU101788 - isvavai.cz</a>

Result on the web

<a href="http://www.springerlink.com/content/p14x123477v1r722/" target="_blank" >http://www.springerlink.com/content/p14x123477v1r722/</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s10703-012-0150-8" target="_blank" >10.1007/s10703-012-0150-8</a>

Result language

angličtina

Original language name

Forest Automata for Verification of Heap Manipulation

Original language description

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 re

Czech name

—

Czech description

—

Type

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

CEP classification

IN - Informatics

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Publication year

2012

Confidentiality

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

Name of the periodical

FORMAL METHODS IN SYSTEM DESIGN

ISSN

0925-9856

e-ISSN

—

Volume of the periodical

2012

Issue of the periodical within the volume

41

Country of publishing house

US - UNITED STATES

Number of pages

24

Pages from-to

83-106

UT code for WoS article

—

EID of the result in the Scopus database

—