Publication Details

Pattern-based Verification for Trees

ČEŠKA Milan, ERLEBACH Pavel and VOJNAR Tomáš. Pattern-based Verification for Trees. In: Computer Aided Systems Theory. Lecture Notes in Computer Science, vol. 4739. Berlin: Springer Verlag, 2007, pp. 488-496. ISBN 978-3-540-75866-2.
Czech title
Verifikace založená na vzorech pro programy pracující se stromy
Type
conference paper
Language
english
Authors
Češka Milan, prof. RNDr., CSc. (DITS FIT BUT)
Erlebach Pavel, Ing. (DITS FIT BUT)
Vojnar Tomáš, prof. Ing., Ph.D. (DITS FIT BUT)
Keywords

formal verification, program analysis, shape analysis, dynamic data structures, repeated patterns

Abstract

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.

Published
2007
Pages
488-496
Proceedings
Computer Aided Systems Theory
Series
Lecture Notes in Computer Science
Volume
4739
Conference
11th International Conference on Computer Aided Systems Theory and Technology, EUROCAST 2007, Las Palmas, Gran Canaria, ES
ISBN
978-3-540-75866-2
Publisher
Springer Verlag
Place
Berlin, DE
BibTeX 
@INPROCEEDINGS{FITPUB8511,
   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 = "Lecture Notes in Computer Science",
   volume = 4739,
   year = 2007,
   location = "Berlin, DE",
   publisher = "Springer Verlag",
   ISBN = "978-3-540-75866-2",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/8511"
}
Back to top