References

1. Christopher Bak (2015): GP 2: Efficient Implementation of a Graph Programming Language. Department of Computer Science, University of York. Available at http://etheses.whiterose.ac.uk/12586/.
2. Christopher Bak & Detlef Plump (2012): Rooted Graph Programs. In: Proc. Int. Workshop on Graph Based Tools (GraBaTs 2012), Electronic Communications of the EASST 54, doi:10.14279/tuj.eceasst.54.780.
3. Jon Haël Brenas, Rachid Echahed & Martin Strecker (2018): Verifying Graph Transformations with Guarded Logics. In: Proc. Int. Symposium on Theoretical Aspects of Software Engineering (TASE 2018). IEEE, pp. 124–131, doi:10.1109/TASE.2018.00024.
4. Graham Campbell, Jack Romö & Detlef Plump (2020): The Improved GP+.1667em2 Compiler. ArXiv e-prints arXiv:2010.03993 [cs.PL]. Available at https://arxiv.org/abs/2010.03993.
5. Stephen A. Cook (1978): Soundness and Completeness of an Axiom System for Program Verification. SIAM Journal on Computing 7(1), pp. 70–90, doi:10.1137/0207005.
6. Bruno Courcelle & Joost Engelfriet (2012): Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach. Cambridge University Press, doi:10.1017/CBO9780511977619.
7. Edsger W. Dijkstra & Carel S. Scholten (1990): Predicate Calculus and Program Semantics. Texts and Monographs in Computer Science. Springer, doi:10.1007/978-1-4612-3228-5.
8. Hartmut Ehrig, Karsten Ehrig, Ulrike Prange & Gabriele Taentzer (2006): Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science. An EATCS Series. Springer, doi:10.1007/3-540-31188-2.
9. Annegret Habel & Karl-Heinz Pennemann (2009): Correctness of high-level transformation systems relative to nested conditions. Math. Struct. Comput. Sci. 19(2), pp. 245–296, doi:10.1017/S0960129508007202.
10. Clifford B. Jones, A.W. Roscoe & Kenneth R. Wood (2010): Reflections on the Work of C.A.R. Hoare. Springer, doi:10.1007/978-1-84882-912-1.
11. Leonid Libkin (2004): Elements of Finite Model Theory. Texts in Theoretical Computer Science. Springer, doi:10.1007/978-3-662-07003-1.
12. James Donald Monk (1976): Mathematical Logic. Graduate Texts in Mathematics 37. Springer, doi:10.1007/978-1-4684-9452-5.
13. Karl-Heinz Pennemann (2009): Development of Correct Graph Transformation Systems. Department of Computing Science, University of Oldenburg. Available at http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/diss_pennemann.pdf.
14. Detlef Plump (2012): The Design of GP 2. In: Proc. Workshop on Reduction Strategies in Rewriting and Programming (WRS 2011), EPTCS 82, pp. 1–16, doi:10.4204/EPTCS.82.1.
15. Christopher M. Poskitt (2013): Verification of Graph Programs. The University of York. Available at http://etheses.whiterose.ac.uk/4700/.
16. Christopher M. Poskitt & Detlef Plump (2010): A Hoare Calculus for Graph Programs. In: Proc. Int. Conference on Graph Transformation (ICGT 2010), LNCS 6372. Springer, pp. 139–154, doi:10.1007/978-3-642-15928-2_10.
17. Christopher M. Poskitt & Detlef Plump (2012): Hoare-Style Verification of Graph Programs. Fundamenta Informaticae 118(1-2), pp. 135–175, doi:10.3233/FI-2012-708.
18. Gia Wulandari & Detlef Plump (2020): Verifying Graph Programs with First-Order Logic (Extended Version). ArXiv e-prints arXiv:2010.14549 [cs.LO]. Available at https://arxiv.org/abs/2010.14549.
19. Gia S. Wulandari & Detlef Plump (2018): Verifying a Copying Garbage Collector in GP+.1667em2. In: Software Technologies: Applications and Foundations – STAF 2018 Collocated Workshops, Revised Selected Papers, LNCS 11176. Springer, pp. 479–494, doi:10.1007/978-3-030-04771-9_34.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org