References

  1. M. Amrani, L. Lucio, G. Selim, B. Combemale, J. Dingel, H. Vangheluwe, Y. Le Traon & J.R. Cordy (2012): A Tridimensional Approach for Studying the Formal Verification of Model Transformations. In: ICST'12, pp. 921–928, doi:10.1109/ICST.2012.197.
  2. M. Dodds & D. Plump (2006): Graph Transformation in Constant Time. In: ICGT'06, LNCS 4178. Springer, pp. 367–382, doi:10.1007/11841883_26.
  3. H. Ehrig, K. Ehrig, J. de Lara, G. Taentzer, D. Varró & S. Varró-Gyapay (2005): Termination Criteria for Model Transformation. In: FASE'05, LNCS 3442. Springer, pp. 49–63, doi:10.1007/978-3-540-31984-9_5.
  4. H. Ehrig, K. Ehrig, U. Prange & G. Taentzer (2006): Fundamentals of Algebraic Graph Transformation. EATCS Monographs in Theoretical Computer Science. Springer, doi:10.1007/3-540-31188-2.
  5. L.J.P Engelen (2012): From Napkin Sketches to Reliable Software. Eindhoven University of Technology, doi:10.6100/IR740040.
  6. L.J.P. Engelen & A.J. Wijs (2012): Incremental Formal Verification for Model Refining. In: MoDeVVa'12. ACM Computer Society Press, pp. 29–34, doi:10.1145/2427376.2427382.
  7. L. Grunske, L. Geiger, A. Zündorf, N. Van Eetvelde, P. Van Gorp & D. Varró (2005): Using Graph Transformation for Practical Model-Driven Software Engineering. In: Model-Driven Software Development. Springer, pp. 91–118, doi:10.1007/3-540-28554-7_5.
  8. R. Heckel, J.M. Küster & G. Taentzer (2002): Confluence of Typed Attributed Graph Transformation Systems. In: ICGT'02, LNCS 2505. Springer, pp. 161–176, doi:10.1007/3-540-45832-8_14.
  9. G. Huet (1980): Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. J. ACM 27(4), pp. 797–821, doi:10.1145/322217.322230.
  10. M. Hülsbusch, B. König, A. Rensink, M. Semenyak, C. Soltenborn & H. Wehrheim (2010): Showing Full Semantics Preservation in Model Transformation - A Comparison of Techniques. In: IFM'10, LNCS 6396. Springer, pp. 183–198, doi:10.1007/978-3-642-16265-7_14.
  11. L. Lambers, H. Ehrig & F. Orejas (2006): Conflict Detection for Graph Transformation with Negative Application Conditions. In: ICGT'06, LNCS 4178. Springer, pp. 61–76, doi:10.1007/11841883_6.
  12. L. Lambers, H. Ehrig & F. Orejas (2006): Efficient Detection of Conflicts in Graph-Based Model Transformations. In: GraMoT'05, ENTCS 152, pp. 97–109, doi:10.1016/j.entcs.2006.01.017.
  13. L. Lambers, H. Ehrig & F. Orejas (2008): Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs. In: GT-VMT'06, ENTCS 211, pp. 17–26, doi:10.1016/j.entcs.2008.04.026.
  14. F. Lang (2005): Exp.Open2.0: A Flexible Tool Integrating Partial Order, Compositional, and On-the-Fly Verification Methods. In: IFM'05, LNCS 3771. Springer, pp. 70–88, doi:10.1007/11589976_6.
  15. R. Mateescu & A.J. Wijs (2012): Sequential and Distributed On-The-Fly Computation of Weak Tau-Confluence. Science of Computer Programming 70(10,11), pp. 1075–1094, doi:10.1016/j.scico.2011.07.004.
  16. A. Narayanan & G. Karsai (2008): Towards Verifying Model Transformations. In: GT-VMT'06, ENTCS 211, pp. 191–200, doi:10.1016/j.entcs.2008.04.041.
  17. M.H.A. Newman (1942): On Theories with a Combinatorial Definition of ``Equivalence''. Annals of Mathematics 43(2), pp. 223–243, doi:10.2307/1968867.
  18. R. Paige & R.E. Tarjan (1984): A Linear Time Algorithm to Solve the Single Function Coarsest Partition Problem. In: ICALP, LNCS 172. Springer, pp. 371–379, doi:10.1007/3-540-13345-3_33.
  19. D. Plump (1993): Hypergraph rewriting: Critical pairs and undecidability of confluence. In: R. Sleep, R. Plasmeijer & M. van Eekelen: Term Graph Rewriting: Theory and Practice, chapter 15. John Wiley, pp. 201–213.
  20. D. Plump (2005): Confluence of Graph Transformation Revisited. In: Processes, Terms and Cycles: Steps on the Road to Infinity, LNCS 3838. Springer, pp. 280–308, doi:10.1007/11601548_16.
  21. D. Plump (2010): Checking Graph Transformation Systems for Confluence. In: Essays Dedicated to Hans-Jörg Kreowski, ECEASST 26. EASST.
  22. L.A. Rahim & J. Whittle (2013): A Survey of Approaches for Verifying Model Transformations. Software and Systems Modeling, doi:10.1007/s10270-013-0358-0.
  23. G. Taentzer, K. Ehrig, E. Guerra, J. de Lara, L. Lengyel, T. Levendovszky, U. Prange, D. Varró & S. Varró-Gyapay (2006): Model Transformation by Graph Transformation: A Comparative Study. In: MTIP'05, pp. 71–80.
  24. A.J. Wijs (2013): Define, Verify, Refine: Correct Composition and Transformation of Concurrent System Semantics. In: FACS'13, LNCS 8348. Springer, pp. 348–368, doi:10.1007/978-3-319-07602-7_21.
  25. A.J. Wijs & L.J.P. Engelen (2013): Efficient Property Preservation Checking of Model Refinements. In: TACAS'13, LNCS 7795. Springer, pp. 565–579, doi:10.1007/978-3-642-36742-7_41.
  26. A.J. Wijs & L.J.P. Engelen (2014): REFINER: Towards Formal Verification of Model Transformations. In: NFM'14, LNCS 8430. Springer, pp. 258–263, doi:10.1007/978-3-319-06200-6_21.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org