Conference paper

ČEŠKA Milan, ERLEBACH Pavel and VOJNAR Tomáš. Pattern-based Verification for Trees. In: Computer Aided Systems Theory. Berlin: Springer Verlag, 2007, pp. 488-496. ISBN 978-3-540-75866-2.
Publication language:english
Original title:Pattern-based Verification for Trees
Title (cs):Verifikace založená na vzorech pro programy pracující se stromy
Pages:488-496
Proceedings:Computer Aided Systems Theory
Conference:11th International Conference on Computer Aided Systems Theory and Technology, EUROCAST 2007
Series:LNCS 4739
Place:Berlin, DE
Year:2007
ISBN:978-3-540-75866-2
Publisher:Springer Verlag
Keywords
formal verification, program analysis, shape analysis, dynamic data structures, repeated patterns
Annotation
Pattern-based verification trying to abstract away the concrete number of repeated memory structures is one of the approaches that have recently been proposed for verification of programs using dynamic data structures linked with pointers. It proved to be very efficient and promising on extended linear data structures. In this paper, we overview some possibilities how to extend this approach to programs over tree structures.
BibTeX:
@INPROCEEDINGS{
   author = {Milan {\v{C}}e{\v{s}}ka and Pavel Erlebach and
	Tom{\'{a}}{\v{s}} Vojnar},
   title = {Pattern-based Verification for Trees},
   pages = {488--496},
   booktitle = {Computer Aided Systems Theory},
   series = {LNCS 4739},
   year = {2007},
   location = {Berlin, DE},
   publisher = {Springer Verlag},
   ISBN = {978-3-540-75866-2},
   language = {english},
   url = {http://www.fit.vutbr.cz/research/view_pub.php.en.iso-8859-2?id=8511}
}

Your IPv4 address: 54.234.247.118
Switch to IPv6 connection

DNSSEC [dnssec]