Detail publikace

Pattern-based Verification for Trees

Originální název

Pattern-based Verification for Trees

Anglický název

Pattern-based Verification for Trees

Jazyk

en

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.

Anglický 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.

BibTex


@inproceedings{BUT30896,
  author="Pavel {Erlebach} and Tomáš {Vojnar} and Milan {Češka}",
  title="Pattern-based Verification for Trees",
  annote="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.",
  address="Springer Verlag",
  booktitle="Computer Aided Systems Theory",
  chapter="30896",
  edition="LNCS 4739",
  howpublished="print",
  institution="Springer Verlag",
  journal="Lecture Notes in Computer Science (IF 0,513)",
  year="2007",
  month="november",
  pages="488--496",
  publisher="Springer Verlag",
  type="conference paper"
}