A query language with the star operator

Electronic Communications of the EASST

Volumn 6, Issue , 2007, Pages

  Lindqvist, Johan ^a   Lundkvist, Torbjörn ^a   Porres, Ivan ^a  

^a ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

Graph query; Graph subgraph matching; Model transformation; Visual languages

Indexed keywords

EID: 84884602786     PISSN: None     EISSN: 18632122     Source Type: Journal    
DOI: 10.14279/tuj.eceasst.6.55.40     Document Type: Conference Paper

References (21)

1. C. Amelunxen, T. Rötschke, A. Schürr. Graph Transformations with MOF 2.0. In Giese and Zündorf (eds.), Fujaba Days 2005. September 2005
2. L. Baresi, R. Heckel. Tutorial Introduction to Graph Transformation: A Software Engineering Perspective. In Corradini et al. (eds.), Proc. Graph Transformation-First International Conf., ICGT 2002, Barcelona, Spain. LNCS 2505. Springer, 2002
3. T. Baar, J. Whittle. On the Usage of Concrete Syntax in Model Transformation Rules. Technical report LGL-REPORT-2006-002, 2006
4. L. P. Cordella, P. Foggia, C. Sansone, M. Vento. An improved algorithm for matching large graphs. In Proceedings of the 3rd IAPR-TC-15 International Workshop on Graph-based Representations. Italy. Pp. 149-159. 2001
5. L. P. Cordella, P. Foggia, C. Sansone, M. Vento. A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10):1367-1372, 2004
6. A. Habel, R. Heckel, G. Taentzer. Graph grammars with negative application conditions. Fundamenta Informaticae 26(3-4):287-313, 1996
7. B. Hoffmann, D. Janssens, N. V. Eetvelde. Cloning and Expanding Graph Transformation Rules for Refactoring. Electr. Notes Theor. Comput. Sci. 152:53-67, 2006
8. B. Hoffmann. Graph Transformation with Variables. In Formal Methods in Software and Systems Modeling. Pp. 101-115. 2005
9. G. Karsai, A. Agrawal. Graph Transformations in OMG's Model-Driven Architecture: (Invited Talk). In Pfaltz et al. (eds.), AGTIVE. Lecture Notes in Computer Science 3062, pp. 243-259. Springer, 2003
10. D. Kozen. A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events. In Logic in Computer Science. Pp. 214-225. 1991
11. T. Lillqvist. Subgraph Matching in Model Driven Engineering. Master's Thesis in Computer Science, Department of Information Technologies, Åbo Akademi University, Turku, Finland, March 2006
12. J. Lilius, T. Lillqvist, T. Lundkvist, I. Oliver, I. Porres, K. Sandström, G. Sveholm, A. Pervez Zaka. An Architecture Exploration Environment for System on Chip Design. Nordic Journal of Computing 12(4):361-378, 2005
13. M. Minas, B. Hoffmann. An Example of Cloning Graph Transformation Rules for Programming. Electronic Notes in Theoretical Computer Science, To appear
14. M. Nyman. A Model-Based Approach to Text Generation from Software Models. Master's Thesis in Computer Science, Department of Information Technologies, Åbo Akademi University, Turku, Finland, May 2006
15. OMG. UML 2.0 OCL Specification. October 2003. Document ptc/03-10-14, available at http://www.omg.org/
16. OMG. MOF 2.0 Query / View / Transformation Final Adopted Specification. November 2005. OMG Document ptc/05-11-01, available at http://www.omg.org/
17. OMG. UML 2.0 Superstructure Specification. August 2005. Document formal/05-07-04. Available at http://www.omg.org/
18. G. Rozenberg (ed.). Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations. World Scientific, 1997
19. A. Schürr, A. J.Winter, A. Zündorf. The PROGRES Approach: Language and Environment. Handbook of Graph Grammars and Computing by Graph Transformation: Vol. 2: Applications, Languages, and Tools, pp. 487-550, 1999
20. E. Tsang. Foundations of Constraint Satisfaction. Academic Press, London and San Diego, 1993
21. D. Varró, G. Varró, A. Pataricza. Designing the Automatic Transformation of Visual Languages. Science of Computer Programming 44(2):205-227, August 2002. http://www.inf.mit.bme.hu/FTSRG/Publications/varro/2002/scp2002_vvp.pdf