Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F13%3APU106387" target="_blank" >RIV/00216305:26230/13:PU106387 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata
Original language description
We present a general framework for verifying programs with complex dynamic linked data structures whose correctness depends on ordering relations between stored data values. Our framework is based on the notion of forest automata (FA) previously developed for verification of heap-manipulating programs. We extend FA by constraints between data elements associated with nodes of the heaps represented by FA, and we propose necessary modifications of all the operations needed for a use of the extended FA in a fully-automated verification approach, based on abstract interpretation. We have implemented our approach as an extension of the Forester tool, and applied it to a number of programs dealing with data structures such as various forms of singly- and doubly-linked lists, binary search trees, as well as skip lists. The experiments show that our approach is not only fully automated, rather general, but also quite efficient.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
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
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of ATVA'13
ISBN
978-3-319-02443-1
ISSN
—
e-ISSN
—
Number of pages
15
Pages from-to
224-239
Publisher name
Springer Verlag
Place of publication
Heidelberg
Event location
Historical Campus, Vietnam National University,
Event date
Oct 14, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—