Detail publikačního výsledku

Pattern-based Verification for Trees

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

Originální název

Pattern-based Verification for Trees

Anglický název

Pattern-based Verification for Trees

Druh

Stať ve sborníku mimo WoS a Scopus

Originální abstrakt

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.

Anglický abstrakt

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.

Klíčová slova

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

Klíčová slova v angličtině

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

Autoři

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

Rok RIV

2010

Vydáno

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

Svazek

4739

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