Publication detail

Generalised Multi-Pattern-Based Verification of Programs with Linear Linked Structures

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

Original Title

Generalised Multi-Pattern-Based Verification of Programs with Linear Linked Structures

Type

journal article - other

Language

English

Original Abstract

The paper deals with the problem of automatic verification of programs working with extended linear linked dynamic data structures, in particular, pattern-based verification is considered. In this approach, one can abstract memory configurations by abstracting away the exact number of adjacent occurrences of certain memory patterns. With respect to the previous work on the subject the method presented in the paper has been extended to be able to handle multiple patterns, which allows for verification of programs working with more types of structures and/or with structures with irregular shapes. The experimental results obtained from a prototype implementation of the method show that the method is very competitive and offers a big potential for future extensions.

Keywords

formal verification, program analysis, shape analysis, dynamic linked data structures

Authors

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

RIV year

2007

Released

30. 3. 2007

ISBN

0934-5043

Periodical

Formal Aspects of Computing

Year of study

19

Number

3

State

United States of America

Pages from

363

Pages to

374

Pages count

12

URL

http://www.springerlink.com/content/47472236k6213t7l/

BibTex

@article{BUT45155,
  author="Pavel {Erlebach} and Milan {Češka} and Tomáš {Vojnar}",
  title="Generalised Multi-Pattern-Based Verification of Programs with Linear Linked Structures",
  journal="Formal Aspects of Computing",
  year="2007",
  volume="19",
  number="3",
  pages="363--374",
  issn="0934-5043",
  url="http://www.springerlink.com/content/47472236k6213t7l/"
}