Publication Details

Pattern-based Verification for Trees

ERLEBACH, P.; VOJNAR, T.; ČEŠKA, M. Pattern-based Verification for Trees. Computer Aided Systems Theory. Lecture Notes in Computer Science. Berlin: Springer Verlag, 2007. p. 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
Erlebach Pavel, Ing., Ph.D.
Vojnar Tomáš, prof. Ing., Ph.D. (DITS)
Češka Milan, prof. RNDr., CSc.
Keywords

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

Abstract

Pattern-based verification trying to abstract away the concrete numberof repeated memory structures is one of the approaches that haverecently been proposed for verification of programs using dynamic datastructures linked with pointers. It proved to be very efficient andpromising on extended linear data structures. In this paper, weoverview some possibilities how to extend this approach to programsover 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
BibTeX 
@inproceedings{BUT30896,
  author="Pavel {Erlebach} and Tomáš {Vojnar} and Milan {Češka}",
  title="Pattern-based Verification for Trees",
  booktitle="Computer Aided Systems Theory",
  year="2007",
  series="Lecture Notes in Computer Science",
  volume="4739",
  pages="488--496",
  publisher="Springer Verlag",
  address="Berlin",
  isbn="978-3-540-75866-2"
}
Back to top