Reineke, Jan
Shape Analysis of Sets
Abstract
Shape Analysis is concerned with determining "shape invariants", i.e. structural properties of the heap, for programs that manipulate pointers and heap-allocated storage. Recently, very precise shape analysis algorithms have been developed that are able to prove the partial correctness of heap-manipulating programs. We explore the use of shape analysis to analyze abstract data types (ADTs). The ADT Set shall serve as an example, as it is widely used and can be found in most of the major data type libraries, like STL, the Java API, or LEDA. We formalize our notion of the ADT Set by algebraic specification. Two prototypical C set implementations are presented, one based on lists, the other on trees. We instantiate a parametric shape analysis framework to generate analyses that are able to prove the compliance of the two implementations to their specification.
BibTeX - Entry
@InProceedings{reineke:DSP:2006:698,
author = {Jan Reineke},
title = {Shape Analysis of Sets},
booktitle = {Workshop "Trustworthy Software" 2006 },
year = {2006},
editor = {Serge Autexier and Stephan Merz and Leon van der Torre and Reinhard Wilhelm and Pierre Wolper},
publisher = {Internationales Begegnungs- und Forschungszentrum f{"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2006/698},
annote = {Keywords: Shape analysis, adt, algebraic specification, invariants, verification, set implementations, imperative programs},
ISBN = {978-3-939897-02-6}
}
|
Keywords: |
|
Shape analysis, adt, algebraic specification, invariants, verification, set implementations, imperative programs |
|
Seminar: |
|
Workshop "Trustworthy Software" 2006
|
|
Documenttype: |
|
InProceedings |
|
Issue date: |
|
2006 |
|
Date of publication: |
|
26.09.2006 |
