Efficient Detection of Conflicts in Graph-based Model Transformation
暂无分享,去创建一个
[1] Reiko Heckel,et al. Algebraic Approaches to Graph Transformation - Part I: Basic Concepts and Double Pushout Approach , 1997, Handbook of Graph Grammars.
[2] Gerard Huet,et al. Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[3] HuetGérard. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980 .
[4] Juan de Lara,et al. Automated Model Transformation and Its Validation Using AToM 3 and AGG , 2004, Diagrams.
[5] Detlef Plump,et al. Hypergraph rewriting: critical pairs and undecidability of confluence , 1993 .
[6] Detlef Plump,et al. Term graph rewriting , 1999 .
[7] Grzegorz Rozenberg,et al. Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .
[8] Hartmut Ehrig,et al. Theory of Constraints and Application Conditions: From Graphs to High-Level Structures , 2004, Fundam. Informaticae.
[9] Hartmut Ehrig,et al. Fundamental Theory for Typed Attributed Graph Transformation , 2004, ICGT.
[10] Hartmut Ehrig,et al. Adhesive High-Level Replacement Categories and Systems , 2004, ICGT.
[11] Dániel Varró,et al. Termination Criteria for Model Transformation , 2005, Transformation Techniques in Software Engineering.
[12] Gabriele Taentzer,et al. AGG: A Graph Transformation Environment for Modeling and Validation of Software , 2003, AGTIVE.
[13] Reiko Heckel,et al. Graph Grammars with Negative Application Conditions , 1996, Fundam. Informaticae.