References

  1. C. Baier & J. P. Katoen (2008): Principles of Model Checking. MIT Press, New York.
  2. P. Baldan, A. Corradini & B. König (2001): A Static Analysis Technique for Graph Transformation Systems. In: International Conference on Concurrency Theory (CONCUR), LNCS 2154. Springer, pp. 381–395. Available at http://dx.doi.org/10.1007/3-540-44685-0_26.
  3. J. Bauer, I. B. Boneva, M. E. Kurban & A. Rensink (2008): A Modal-Logic Based Graph Abstraction. In: editor = "Ehrig",, pp. 321–335. Available at http://dx.doi.org/10.1007/978-3-540-87405-8_22.
  4. J. Bauer & R. Wilhelm (2007): Static Analysis of Dynamic Communication Systems by Partner Abstraction. In: Static Analysis Symposium (SAS), LNCS 4634. Springer, pp. 249–264. Available at http://dx.doi.org/10.1007/978-3-540-74061-2_16.
  5. P. Cousot & R. Cousot (1977): Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: Principles of Programming Languages (POPL). ACM, pp. 238–252. Available at http://doi.acm.org/10.1145/512950.512973.
  6. S. Edelkamp, S. Jabbar & A. Lluch-Lafuente (2006): Heuristic Search for the Analysis of Graph Transition Systems. In: International Conference on Graph Transformations (ICGT), LNCS 4178. Springer, pp. 414–429. Available at http://dx.doi.org/10.1007/11841883_29.
  7. H. Ehrig, G. Engels, H.-J. Kreowski & G. Rozenberg (1999): Handbook of Graph Grammars and Computing by Graph Transformation: Applications, Languages, and Tools. World Scientific Publishing Co..
  8. H. Ehrig, R. Heckel, G. Rozenberg & G. Taentzer (2008): International Conference on Graph Transformations (ICGT). LNCS 5214. Springer.
  9. A. Ghamarian, M. de Mol, A. Rensink, E. Zambon & M. Zimakova (2012): Modelling and Analysis Using groove. International Journal on Software Tools for Technology Transfer (STTT) 14(1), pp. 15–40. Available at http://dx.doi.org/10.1007/s10009-011-0186-x.
  10. P. Godefroid (1996): Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem. Springer Verlag, New York.
  11. R. Holte, T. Mkadmi, R. Zimmer & A. MacDonald (1996): Speeding up Problem Solving by Abstraction: A Graph Oriented Approach. Artificial Intelligence 85(1-2), pp. 321–361. Available at http://dx.doi.org/10.1016/0004-3702(95)00111-5.
  12. B. König & V. Kozioura (2006): Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems. In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), LNCS 3920. Springer, pp. 197–211. Available at http://dx.doi.org/10.1007/11691372_13.
  13. B. König & V. Kozioura (2008): Augur 2 - A New Version of a Tool for the Analysis of Graph Transformation Systems. Electronic Notes in Theoretical Computer Science (ENTCS) 211, pp. 201–210. Available at http://dx.doi.org/10.1016/j.entcs.2008.04.042.
  14. A. Rensink (2004): The grooveSimulator: A Tool for State Space Generation. In: Applications of Graph Transformations with Industrial Relevance (AGTIVE), LNCS 3062. Springer, pp. 479–485. Available at http://dx.doi.org/10.1007/978-3-540-25959-6_40.
  15. A. Rensink (2004): Canonical Graph Shapes. In: European Symposium on Programming (ESOP), LNCS 2986. Springer, pp. 401–415. Available at http://dx.doi.org/10.1007/978-3-540-24725-8_28.
  16. A. Rensink (2006): Isomorphism Checking in groove. In: International Workshop on Graph-Based Tools (GraBaTs), Electronic Communications of the EASST 1. European Association of Software Science and Technology. Available at http://eceasst.cs.tu-berlin.de/index.php/eceasst/article/view/77.
  17. A. Rensink & D. Distefano (2006): Abstract Graph Transformation. In: Workshop on Software Verification and Validation (SVV), Electronic Notes in Theoretical Computer Science (ENTCS) 157, pp. 39–59. Available at http://dx.doi.org/10.1016/j.entcs.2006.01.022.
  18. A. Rensink & E. Zambon (2010): Neighbourhood Abstraction in groove. In: International Workshop on Graph-Based Tools (GraBaTs), Electronic Communications of the EASST 32. European Association of Software Science and Technology. Available at http://journal.ub.tu-berlin.de/index.php/eceasst/article/view/501.
  19. S. Rieger & T. Noll (2008): Abstracting Complex Data Structures by Hyperedge Replacement. In: editor = "Ehrig",, pp. 69–83. Available at http://dx.doi.org/10.1007/978-3-540-87405-8_6.
  20. S. Sagiv, T. W. Reps & R. Wilhelm (2002): Parametric Shape Analysis via 3-valued Logic. Transactions on Programming Languages and Systems (ToPLaS) 24(3), pp. 217–298. Available at http://doi.acm.org/10.1145/514188.514190.
  21. M. Saksena, O. Wibling & B. Jonsson (2008): Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols. In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), LNCS 4963. Springer, pp. 18–32. Available at http://dx.doi.org/10.1007/978-3-540-78800-3_3.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org