Symbolic graphs for attributed graph constraints

Journal of Symbolic Computation

Volumn 46, Issue 3, 2011, Pages 294-315

  Orejas, Fernando ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Attributed graphs; Graph constraints; Symbolic graphs

Indexed keywords

EID: 78951474598     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2010.09.009     Document Type: Article

References (22)

1. Berthold, M., Fischer, I., Koch, M., 2000. Attributed graph transformation with partial attribution. In: GRATRA 2000. Joint APPLIGRAPH and GETGRATS Workshop on Graph Transformation Systems. pp. 171-178.
2. Courcelle B. The expression of graph properties and graph transformations in monadic second-order logic. Handbook of Graph Grammars and Computing by Graph Transformation, vol 1 1997, 313-400. Foundations. World Scientific. G. Rozenberg (Ed.).
3. de Lara J., Guerra E. Pattern-based model-to-model transformation. LNCS 2008, vol. 5214:426-441. Springer.
4. Ehrig H. Attributed graphs and typing: Relationship between different representations. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 2004, 82:175-190.
5. Ehrig H., Ehrig K., Prange U., Taentzer G. Fundamental theory of typed attributed graph transformation based on adhesive HLR-categories. Fund. Inform. 2006, 74(1):31-61.
6. Ehrig H., Ehrig K., Prange U., Taentzer G. Fundamentals of Algebraic Graph Transformation. EATCS Monographs of Theoretical Computer Science 2006, Springer.
7. Ehrig H., Habel A. Graph grammars with application conditions. The Book of L. Springer 1986, 87-100. G. Rozenberg (Ed.).
8. Habel A., Heckel R., Taentzer G. Graph grammars with negative application conditions. Fund. Inform. 1996, 26(3/4):287-313.
9. Habel A., Pennemann K.-H. Correctness of high-level transformation systems relative to nested conditions. Math. Structures Comput. Sci. 2009, 19:245-296.
10. Heckel, R., Küster, J., Taentzer, G., 2002. Towards automatic translation of uml models into semantic domains. In: APPLIGRAPH Workshop on Applied Graph Transformation. pp. 11-22.
11. Heckel R., Wagner A. Ensuring consistency of conditional graph grammars - a constructive approach. Electron. Notes Theor. Comput. Sci. 1995, 2:118-126.
12. Koch M., Mancini L., Parisi-Presicce F. Graph-based specification of access control policies. J. Comput. System Sci. 2005, 71:1-33.
13. Lack S., Sobocinski P. Adhesive and quasiadhesive categories. Theor. Inform. Appl. 2005, 39:511-545.
14. Löwe M., Korff M., Wagner A. An algebraic framework for the transformation of attributed graphs. Term Graph Rewriting: Theory and Practice 1993, 185-199. John Wiley, New York.
15. Naeem M., Heckel R., Orejas F., Hermann F. Incremental service composition based on partial matching of visual contracts. LNCS 2010, vol. 6013:123-138. Springer.
16. Orejas F. Attributed graph constraints. LNCS 2008, vol. 5214:274-288. Springer.
17. Orejas F., Ehrig H., Prange U. A logic of graph constraints. LNCS 2008, vol. 4961:179-198. Springer.
18. Orejas F., Ehrig H., Prange U. Reasoning with graph constraints. Formal Aspects of Computing 2009.
19. Orejas, F., Lambers, L., 2010a. Delaying constraint solving in symbolic graph transformation. In: Graph Transformations, ICGT 2010.
20. Orejas, F., Lambers, L., 2010b. Symbolic attributed graphs for attributed graph transformation. In: Int. Coll. on Graph and Model Transformation. On the occasion of the 65th birthday of Hartmut Ehrig.
21. Pennemann K.-H. Resolution-like theorem proving for high-level conditions. LNCS 2008, vol. 5214:289-304. Springer.
22. Rensink A. Representing first-order logic using graphs. LNCS 2004, vol. 3256:319-335. Springer.