| Art der Veröffentlichung: |
Artikel |
| Autor: |
T. Mossakowski, S. Autexier, D. Hutter |
| Titel: |
Development Graphs -- Proof Management for Structured Specifications |
| Band: |
67 |
| Seite(n): |
114 – 145 |
| Zeitschrift: |
Journal of Logic and Algebraic Programming |
| Ausgabe: |
1-2 |
| Erscheinungsjahr: |
2006 |
| Abstract / Kurzbeschreibung: |
Development graphs are a tool for dealing with structured
specifications in a formal program development in order to ease the
management of change and reusing proofs. In this work, we extend
development graphs with hiding (e.g. hidden operations). Hiding is
a particularly difficult to realize operation, since it does not
admit such a good decomposition of the involved specifications as
other structuring operations do. We develop both a semantics and
proof rules for development graphs with hiding. The rules are proven
to be sound, and also complete relative to an oracle for
conservative extensions. We also show that an absolutely complete set
of rules cannot exist.
The whole framework is developed in a way independent of the
underlying logical system (and thus also does not prescribe the
nature of the parts of a specification that may be hidden). We also
show how various other logic independent specification formalisms
can be mapped into development graphs; thus, development graphs can
serve as a kernel formalism for management of proofs and of change. |
| ISSN: |
1567-8326 |
| Internet: |
http://www.sciencedirect.com/science?_ob=GatewayURL&_origin=CONTENTS&_method=citationSearch&_piikey=S1567832605000810&_version=1&md5=7c18897e9ffad42e0649c6b41203f41e |
| PostScript Version: |
http://www.informatik.uni-bremen.de/~till/papers/dgh_journal.ps |
| Schlagworte: |
development graph proof logic institution completeness |
| Status: |
Reviewed |
| Letzte Aktualisierung: |
09. 03. 2006 |
