Forest Automata for Verification of Heap Manipulation

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Forest Automata for Verification of Heap Manipulation

Popis výsledku v původním jazyce

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

Název v anglickém jazyce

Forest Automata for Verification of Heap Manipulation

Popis výsledku anglicky

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

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

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

Rok uplatnění

2012

Kód důvěrnosti údajů

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

Název periodika

FORMAL METHODS IN SYSTEM DESIGN

ISSN

0925-9856

e-ISSN

—

Svazek periodika

2012

Číslo periodika v rámci svazku

41

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

24

Strana od-do

83-106

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—