direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publications Prof. Hartmut Ehrig (TFS)

Reasoning with Graph Constraints
Zitatschlüssel OEP09
Autor Fernando Orejas and Hartmut Ehrig and Ulrike Prange
Seiten 385–422
Jahr 2009
ISBN ISSN 0934-5043
DOI 10.1007/s00165-009-0116-9
Journal Formal Aspects of Computing
Jahrgang 22
Nummer 3–4
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 two classes of graph constraints and show that our proof rules are sound and (refutationally) complete for each class. In addition, we study clause subsumption in this context as a form to speed up refutation.
Link zur Publikation Download Bibtex Eintrag

Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe