Publication detail

Pattern-based Verification for Trees

ERLEBACH, P. VOJNAR, T. ČEŠKA, M.

Original Title

Pattern-based Verification for Trees

Type

article in a collection out of WoS and Scopus

Language

English

Original 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.

Keywords

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

Authors

ERLEBACH, P.; VOJNAR, T.; ČEŠKA, M.

RIV year

2007

Released

8. 11. 2007

Publisher

Springer Verlag

Location

Berlin

ISBN

978-3-540-75866-2

Book

Computer Aided Systems Theory

Edition

Lecture Notes in Computer Science

Pages from

488

Pages to

496

Pages count

9

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"
}