Conference paper

BOUAJJANI Ahmed, HABERMEHL Peter, MORO Pierre and VOJNAR Tomáš. Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking. In: Tools and Algorithms for the Construction and Analysis of Systems. Berlin: Springer Verlag, 2005, pp. 13-29. ISBN 978-3-540-25333-4.
Publication language:english
Original title:Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking
Title (cs):Verifikace programů s dynamickými datovými strukturami s jedním ukazatelem na následníka pomocí regulárního model checkingu
Pages:13-29
Proceedings:Tools and Algorithms for the Construction and Analysis of Systems
Conference:11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems -- TACAS 2005
Series:LNCS 3440
Place:Berlin, DE
Year:2005
ISBN:978-3-540-25333-4
Publisher:Springer Verlag
URL:http://www.fit.vutbr.cz/~vojnar/Publications/bhmv-lists-05.ps.gz [PS]
Keywords
formal verification, model checking, infinite-state systems, software verification, dynamic data structures
Annotation
We address the problem of automatic verification of programs with dynamic data structures. We consider the case of sequential, non-recursive programs manipulating 1-selector-linked structures such as traditional linked lists (possibly sharing their tails) and circular lists. We propose an automata-based approach for a symbolic verification of such programs using the regular model checking framework. Given a program, the configurations of the memory are systematically encoded as words over a suitable finite alphabet, potentially infinite sets of configurations are represented by finite-state automata, and statements of the program are automatically translated into finite-state transducers defining regular relations between configurations. Then, abstract regular model checking techniques are applied in order to automatically check safety properties concerning the shape of the computed configurations or relating the input and output configurations. For this particular purpose, we introduce new techniques for the computation of abstractions of the set of reachable configurations and to refine these abstractions if spurious counterexamples are detected.  Finally, we present experimental results showing the applicability of the approach and its efficiency.

BibTeX:
@INPROCEEDINGS{
   author = {Ahmed Bouajjani and Peter Habermehl and Pierre
	Moro and Tom{\'{a}}{\v{s}} Vojnar},
   title = {Verifying Programs with Dynamic 1-Selector-Linked
	Structures in Regular Model Checking},
   pages = {13--29},
   booktitle = {Tools and Algorithms for the Construction and Analysis of
	Systems},
   series = {LNCS 3440},
   year = {2005},
   location = {Berlin, DE},
   publisher = {Springer Verlag},
   ISBN = {978-3-540-25333-4},
   language = {english},
   url = {http://www.fit.vutbr.cz/research/view_pub.php?id=7814}
}

Your IPv4 address: 34.207.82.217
Switch to https