Reasoning with graph constraints - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Formal Aspects of Computing Année : 2009

Reasoning with graph constraints

Fernando Orejas
  • Fonction : Auteur correspondant
  • PersonId : 872871

Connectez-vous pour contacter l'auteur
Hartmut Ehrig
  • Fonction : Auteur
Ulrike Prange
  • Fonction : Auteur

Résumé

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.
Fichier principal
Vignette du fichier
PEER_stage2_10.1007%2Fs00165-009-0116-9.pdf (353.54 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00497320 , version 1 (04-07-2010)

Identifiants

Citer

Fernando Orejas, Hartmut Ehrig, Ulrike Prange. Reasoning with graph constraints. Formal Aspects of Computing, 2009, 22 (3), pp.385-422. ⟨10.1007/s00165-009-0116-9⟩. ⟨hal-00497320⟩

Collections

PEER
60 Consultations
118 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More