MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Proceedings Article, Paper


@InProceedings
Beitrag in Tagungsband, Workshop
Author, Editor
Author(s):
Georgieva, Lilia
Maier, Patrick		dblp
dblp
Not MPG Author(s):
Georgieva, Lilia
Editor(s):
Aichernig, Bernhard K.
Beckert, Bernhard		dblp
dblp
Not MPII Editor(s):
Aichernig, Bernhard K.
Beckert, Bernhard
BibTeX cite key*:
GeorgievaMaier2005
Title, Booktitle
Title*:
Description Logics for Shape Analysis
Booktitle*:
Third IEEE International Conference on Software Engineering and Formal Methods (SEFM 2005)
Event, URLs
Conference URL::
http://sefm2005.uni-koblenz.de
Downloading URL:
Event Address*:
Koblenz, Germany
Language:
English
Event Date*
(no longer used):
Organization:
IEEE Computer Society
Event Start Date:
7 September 2005
Event End Date:
9 September 2005
Publisher
Name*:
IEEE
URL:
http://www.computer.org
Address*:
Los Alamitos, USA
Type:
Vol, No, Year, pp.
Series:
Volume:
Number:
Month:
September
Pages:
321-330
Year*:
2005
VG Wort Pages:
ISBN/ISSN:
0-7695-2435-4
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
Verification of programs requires reasoning about sets of program
states. In case of programs manipulating pointers, program states are
pointer graphs. Verification of such programs involves reasoning
about unbounded sets of graphs.

Three-valued shape analysis (Sagiv et. al.) is an approach based on
explicit manipulation of 3-valued shape graphs, which abstract sets of
pointer graphs. Other approaches use symbolic representations,
e.g. by describing (sets of) graphs as logical formulas.
Unfortunately, many resulting logics are either undecidable or cannot
express crucial properties like reachability and separation.

In this paper, we investigate an alternative approach. We study
well-known description logics as a framework for symbolic shape
analysis. We propose a predicate abstraction based shape analysis,
parameterized by description logics to represent the abstraction
predicates. Depending on the particular logic chosen sharing,
reachability and separation in pointer data structures are
expressible.
Keywords:
description logics, shape analysis, program analysis, pointer programs
Copyright Message:
Copyright 2005 by The Institute of Electrical and Electronics Engineers, Inc. All rights reserved.
Download
Access Level:
Public

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Programming Logics Group
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, CCL bibliography, VG Wort



BibTeX Entry:
@INPROCEEDINGS{GeorgievaMaier2005,
AUTHOR = {Georgieva, Lilia and Maier, Patrick},
 EDITOR = {Aichernig, Bernhard K. and Beckert, Bernhard},
 TITLE = {Description Logics for Shape Analysis},
 BOOKTITLE = {Third IEEE International Conference on Software Engineering and Formal Methods (SEFM 2005)},
 PUBLISHER = {IEEE},
 YEAR = {2005},
 ORGANIZATION = {IEEE Computer Society},
 PAGES = {321--330},
 ADDRESS = {Koblenz, Germany},
 MONTH = {September},
 ISBN = {0-7695-2435-4},
}

Entry last modified by Christine Kiesel, 01/28/2008
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Patrick Maier		Created
11/11/2005 03:48:19 PM
Revisions
5.
4.
3.
2.
1.		Editor(s)
Christine Kiesel
Christine Kiesel
Christine Kiesel
Christine Kiesel
Christine Kiesel		Edit Dates
25.04.2006 20:35:02
25.04.2006 20:33:43
25.04.2006 20:33:33
25.04.2006 20:32:03
25.04.2006 20:31:52