Detail publikace

Pattern-based Verification for Trees

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

Originální název

Pattern-based Verification for Trees

Typ

článek ve sborníku mimo WoS a Scopus

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova

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

Autoři

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

Rok RIV

2007

Vydáno

8. 11. 2007

Nakladatel

Springer Verlag

Místo

Berlin

ISBN

978-3-540-75866-2

Kniha

Computer Aided Systems Theory

Edice

Lecture Notes in Computer Science

Strany od

488

Strany do

496

Strany počet

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