direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publications Prof. Hartmut Ehrig (TFS)

A Logic of Graph Constraints
Zitatschlüssel OEP08
Autor Orejas, F. and Ehrig, H. and Prange, U.
Buchtitel Proc. Fundamental Approaches to Software Engineering (FASE'08)
Seiten 179–198
Jahr 2008
ISBN 978-3-540-78742-6
DOI 10.1007/978-3-540-78743-3
Ort Budapest, Hungary
Jahrgang 4961
Herausgeber J.L.\ Fiadeiro and P. Inverardi
Serie LNCS
Zusammenfassung Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicability of transformation rules. However, we believe that graph constraints may also play a significant role in the area of visual software modelling or in the specification and verification of semi-structured documents or websites (i.e. HTML or XML sets of documents). In this sense, after some discussion on these application areas, we concentrate on the problem of how to prove the consistency of specifications based on this kind of constraints. In particular, we present proof rules for three classes of (increasingly more powerful) graph constraints and show that our proof rules are sound and (refutationally) complete for each class.
Link zur Publikation Download Bibtex Eintrag

Zusatzinformationen / Extras


Schnellnavigation zur Seite über Nummerneingabe