Detail publikace

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

Originální název

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

Anglický název

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

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

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",
  annote="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.",
  chapter="45155",
  howpublished="print",
  journal="Formal Aspects of Computing",
  number="3",
  volume="19",
  year="2007",
  month="march",
  pages="363--374",
  type="journal article - other"
}