N. Baklanova, J. H. Brenas, R. Echahed, C. Percebois, M. Strecker et al., Provably correct graph transformations with small tALC, ICTERI 2015, pp.78-93, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01517373

M. Schmidt-schauß and G. Smolka, Attributive concept descriptions with complements, Artif. Intell, vol.48, issue.1, pp.1-26, 1991.

Y. Smaragdakis and C. Csallner, Combining static and dynamic reasoning for bug detection, TAP 2007, vol.4454, pp.1-16, 2007.

M. Gordon and H. Collavizza, Forward with Hoare, Reflections on the Work of C.A.R. Hoare. History of Computing Series, pp.101-121, 2010.

B. Beckert and C. Gladisch, White box testing by combining deduction based specification extraction and black box testing, TAP 2007, vol.4454, pp.207-216, 2007.

A. Habel and K. H. Pennemann, Correctness of high level transformation systems relative to nested conditions, Math. Struct. Comput. Sci, vol.19, issue.2, pp.245-296, 2009.

C. M. Poskitt and D. Plump, Hoare style verification of graph programs, Fundam. Inf, vol.118, issue.1, p.175, 2012.

S. Liu and S. Nakajima, Combining specification based testing, correctness proof, and inspection for program verification in practice, SOFL + MSVL 2013, vol.8332, pp.1-18, 2014.

S. Owre, S. Rajan, J. M. Rushby, N. Shankar, and M. K. Srivas, PVS: combining specification, proof checking, and model checking, CAV 1996, vol.1102, pp.411-414, 1996.

C. Engel and R. Hähnle, Generating unit tests from formal proofs, TAP 2007, vol.4454, pp.169-188, 2007.

T. Xie, D. Marinov, W. Schulte, and D. Notkin, Symstra: a framework for generating object oriented unit tests using symbolic execution, TACAS 2005, vol.3440, pp.365-381, 2005.

C. Bak, G. Faulkner, D. Plump, and C. Runciman, A reference interpreter for the graph programming language GP 2, Graphs as Models, vol.181, pp.48-64, 2015.

A. Darabos, A. Pataricza, and D. Varró, Towards testing the implementation of graph transformations, Electron. Notes Theor. Comput. Sci, vol.211, p.85, 2008.

L. Geiger and A. Zündorf, Transforming graph based scenarios into graph transformation based JUnit tests, AGTIVE 2003, vol.3062, pp.61-74, 2004.

M. Molloy and B. Reed, A critical point for random graphs with a given degree sequence, Random Struct. Algorithms, vol.6, issue.2, p.180, 1995.

M. Molloy, B. Reed, J. Zhai, H. Wang, and J. Zhao, The size of the giant component of a random graph with a given degree sequence, Comb. Prob. Comput, vol.7, issue.3, pp.204-212, 1998.