A logic of graph constraints

  • Authors:

  • Fernando Orejas;Hartmut Ehrig;Ulrike Prange

  • Affiliations:

  • Dpto de L.S.I., Universitat Politècnica de Catalunya, Barcelona, Spain;Fak. IV, Technische Universität Berlin, Berlin, Germany;Fak. IV, Technische Universität Berlin, Berlin, Germany

  • Venue:
  • FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.