Publication result detail

Pattern-based Verification for Trees

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

Original Title

Pattern-based Verification for Trees

English Title

Pattern-based Verification for Trees

Type

Paper in proceedings outside WoS and Scopus

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

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

Keywords

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

Key words in English

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

Authors

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

RIV year

2010

Released

08.11.2007

Publisher

Springer Verlag

Location

Berlin

ISBN

978-3-540-75866-2

Book

Computer Aided Systems Theory

Edition

Lecture Notes in Computer Science

Volume

4739

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