Journal article

ČEŠKA Milan, ERLEBACH Pavel and VOJNAR Tomáš. Pattern-Based Verification of Programs with Extended Linear Linked Data Structures. Electronic Notes in Theoretical Computer Science. 2006, vol. 2006, no. 145, pp. 113-130. ISSN 1571-0661.
Publication language:english
Original title:Pattern-Based Verification of Programs with Extended Linear Linked Data Structures
Title (cs):Pattern-Based Verification of Programs with Extended Linear Linked Data Structures
Pages:113-130
Book:Proceedings of the 5th International Workshop on Automated Verification of Critical Systems (AVoCS 2005)
Year:2006
Journal:Electronic Notes in Theoretical Computer Science, Vol. 2006, No. 145, US
ISSN:1571-0661
URL:http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B75H1-4J05Y67-8-1&_cdi=13109&_user=640830&_orig=browse&_coverDate=01%2F14%2F2006&_sk=998549999&view=c&wchp=dGLzVlz-zSkzk&md5=ee9d2a952a112f8b99ffd4cff37e35cd&ie=/sdarticle.pdf [PDF]
Keywords
formal verification, program analysis, dynamic linked data structures

Annotation
The paper deals with the problem of automatic verification of programs with dynamic linked data structures. In particular, the use of pattern-based abstraction of memory configurations is considered. In this approach, one can abstract memory configurations by abstracting away the exact number of adjacent occurrences of certain memory patterns. The paper extends the state-of-the-art in this area by proposing a fully automatic and efficient way of  detecting the memory patterns to be used from the memory  configurations that the program at hand is generating. The method targets programs manipulating a broad class of extended linear linked data structures having a linear skeleton (possibly bidirectionally-linked or cyclic) with certain additional pointers defined on top of it, which covers many practical dynamic data structures (such as lists, doubly-linked lists, cyclic lists, lists with tail/head pointers, etc.). The experimental results obtained from a prototype implementation of the method show that the method is very competitive and offers a big potential for future extensions.
BibTeX:
@ARTICLE{
   author = {Milan {\v{C}}e{\v{s}}ka and Pavel Erlebach and
	Tom{\'{a}}{\v{s}} Vojnar},
   title = {Pattern-Based Verification of Programs with
	Extended Linear Linked Data Structures},
   pages = {113--130},
   booktitle = {Proceedings of the 5th International Workshop on Automated
	Verification of Critical Systems (AVoCS 2005)},
   journal = {Electronic Notes in Theoretical Computer Science},
   volume = {2006},
   number = {145},
   year = {2006},
   ISSN = {1571-0661},
   language = {english},
   url = {http://www.fit.vutbr.cz/research/view_pub.php?id=7985}
}

Your IPv4 address: 3.85.143.239
Switch to https