P. Backes and J. Reineke, A graph transformation case study for the topology analysis of dynamic communication system, CTIT Workshop Proceedings, pp.10-13, 2010.

P. Baldan, B. König, and A. Rensink, Summary 2: Graph grammar verification through abstraction, Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems. Dagstuhl Seminar Proceedings, 2004.

L. Baresi and P. Spoletini, On the Use of Alloy to Analyze Graph Transformation Systems, ) ICGT. LNCS, pp.306-320, 2006.
DOI : 10.1007/11841883_22

C. Barrett, M. Deters, L. De-moura, A. Oliveras, and A. Stump, 6 Years of SMT-COMP, Journal of Automated Reasoning, vol.21, issue.4, pp.1-35, 2012.
DOI : 10.1007/s10817-012-9246-5

C. Barrett, A. Stump, and C. Tinelli, The SMT-LIB Standard: Version 2.0, Proceedings of the 8th International Workshop on Satisfiability Modulo Theories, 2010.
DOI : 10.1007/978-3-642-19583-9_2

B. Becker, D. Beyer, H. Giese, F. Klein, and D. Schilling, Symbolic invariant verification for systems with dynamic structural adaptation, Proceeding of the 28th international conference on Software engineering , ICSE '06, pp.72-81, 2006.
DOI : 10.1145/1134285.1134297
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.7709

G. Bergmann, A. Boronat, R. Heckel, P. Torrini, I. Ráth et al., Advances in Model Transformations by Graph Transformation: Specification, Execution and Analysis, Rigorous Software Engineering for Service- Oriented Systems, pp.561-584, 2011.
DOI : 10.1007/978-3-642-00434-6_5

A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu, Symbolic Model Checking without BDDs, ) TACAS. LNCS, pp.193-207, 1999.
DOI : 10.1007/3-540-49059-0_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.8033

D. Bisztray, R. Heckel, and H. Ehrig, Verification of Architectural Refactorings by Rule Extraction, FASE. Lecture Notes in Computer Science, vol.4961, pp.347-361, 2008.
DOI : 10.1007/978-3-540-78743-3_26

T. Bouton, B. Caminha, D. De-oliveira, D. Déharbe, and P. Fontaine, veriT: An Open, Trustable and Efficient SMT-Solver, Automated Deduction ? CADE-22, pp.151-156, 2009.
DOI : 10.1007/978-3-540-73595-3_38
URL : https://hal.archives-ouvertes.fr/inria-00430634

J. Christ, J. Hoenicke, and A. Nutz, SMTInterpol: An Interpolating SMT Solver, LNCS, vol.7385, pp.248-254, 2012.
DOI : 10.1007/978-3-642-31759-0_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.387.795

A. Cimatti, A. Griggio, B. Schaafsma, and R. Sebastiani, The MathSAT5 SMT Solver, Proceedings of TACAS. LNCS, 2013.
DOI : 10.1007/978-3-642-36742-7_7

H. Ehrig, R. Heckel, M. Korff, M. Löwe, L. Ribeiro et al., Algebraic Approaches to Graph Transformation -Part II: Single Pushout Approach and Comparison with Double Pushout Approach Handbook of Graph Grammars, pp.247-312, 1997.

G. Engels, B. Güldali, C. Soltenborn, and H. Wehrheim, Assuring Consistency of Business Process Models and Web Services Using Visual Contracts, LNCS, vol.44, issue.1, pp.17-31, 2007.
DOI : 10.1147/sj.441.0047

A. Habel, R. Heckel, and G. Taentzer, Graph grammars with negative application conditions, Fundam. Inform, vol.26, issue.34, pp.287-313, 1996.

T. Isenberg, Bounded Model Checking für Graphtransformationssysteme als SMT- Problem, 2012.

H. Kastenberg, Graph-based software specification and verification, 2008.
DOI : 10.3990/1.9789036527347
URL : http://eprints.eemcs.utwente.nl/13615/01/thesis_Kastenberg.pdf

H. A. Kautz and B. Selman, Planning as satisfiability, pp.359-363, 1992.

B. König and V. Kozioura, Augur 2 ??? A New Version of a Tool for the Analysis of Graph Transformation Systems, proceedings of the Fifth International Workshop on Graph Transformation and Visual Modeling Techniques, pp.201-210, 2006.
DOI : 10.1016/j.entcs.2008.04.042

H. J. Kreowski, S. Kuske, and R. Wille, Graph Transformation Units Guided by a SAT Solver, Lecture Notes in Computer Science, vol.6372, pp.27-42, 2010.
DOI : 10.1007/978-3-642-15928-2_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.3861

L. M. De-moura and N. Bjørner, Z3: An Efficient SMT Solver, ) TACAS. LNCS, pp.337-340, 2008.
DOI : 10.1007/978-3-540-78800-3_24

A. Rensink, The joys of graph transformation, 2005.

A. Rensink and E. Zambon, Neighbourhood abstraction in GROOVE, Electronic Communications of the EASST, vol.32, 2011.

A. Rensink, The GROOVE Simulator: A??Tool for State Space Generation, ) AGTIVE. LNCS, pp.479-485, 2003.
DOI : 10.1007/978-3-540-25959-6_40

A. Rensink, E. Zambon, H. Ehrig, G. Engels, H. J. Kreowski et al., Pattern-Based Graph Abstraction, LNCS, vol.7562, pp.66-80, 2012.
DOI : 10.1007/978-3-642-33654-6_5
URL : http://eprints.eemcs.utwente.nl/22348/01/icgt2012-pattern.pdf

J. Rintanen, Planning and sat, Handbook of Satisfiability, pp.483-504, 2009.

M. Sagiv, T. Reps, and R. Wilhelm, Parametric shape analysis via 3-valued logic, ACM Transactions on Programming Languages and Systems, vol.24, issue.3, pp.217-298, 2002.
DOI : 10.1145/514188.514190
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.3161

D. Steenken, H. Wehrheim, and D. Wonisch, Sound and Complete Abstract Graph Transformation, Brazilian Symposium on Formal Methods, pp.92-107, 2011.
DOI : 10.1007/978-3-642-25032-3_7

M. Tichy and B. Klöpper, Planning Self-adaption with Graph Transformations, Applications of Graph Transformations with Industrial Relevance, pp.137-152, 2012.
DOI : 10.1007/978-3-642-34176-2_13

A. Vandin and A. Lluch-lafuente, Towards a maude tool for model checking temporal graph properties, p.41, 2011.

E. Zambon and A. Rensink, Graph subsumption in abstract state space exploration. arXiv preprint arXiv:1210, p.6413, 2012.