Abstract
A preliminary account of the notion of a living monograph for the field of graph transformation, and the reasons that led us to it, is given. The advantages of such a system are discussed along with the technical problems that will need to be overcome in order to build it.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
CoREACT: COq-based Rewriting: towards Executable Applied Category Theory (ANR-22-CE48-0015).
- 2.
e.g. the preservation of monomorphisms under pushout or the stability of pushouts under pullbacks.
References
The QED manifesto. In: Bundy, A. (ed.) Automated Deduction - CADE-12. CADE 1994. LNCS, vol. 814, pp. 238–251. Springer, Berlin, Heidelberg (1994)
Alama, J., Brink, K., Mamane, L., Urban, J.: Large formal wikis: issues and solutions. In: Davenport, J.H., Farmer, W.M., Urban, J., Rabe, F. (eds.) CICM 2011. LNCS (LNAI), vol. 6824, pp. 133–148. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22673-1_10
Arias, E.J.G., Pin, B., Jouvelot, P.: jsCoq: towards hybrid theorem proving interfaces. In: Proceedings of UITP 2016, vol. 239, pp. 15–27. EPTCS (2017)
Arsac, S.: Coq formalization of graph transformation. Master’s thesis, Université Paris-Cité (2022). https://www.samuelarsac.fr/rapport22.pdf
Baresi, L., Heckel, R.: Tutorial introduction to graph transformation: a software engineering perspective. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol. 2505, pp. 402–429. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45832-8_30
Behr, N., Harmer, R., Krivine, J.: Concurrency theorems for non-linear rewriting theories. In: Gadducci, F., Kehrer, T. (eds.) ICGT 2021. LNCS, vol. 12741, pp. 3–21. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-78946-6_1
Behr, N., Harmer, R., Krivine, J.: Fundamentals of compositional rewriting theory (2022). https://arxiv.org/abs/2204.07175
Bertot, Y., Kahn, G., Théry, L.: Proof by pointing. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol. 789, pp. 141–160. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-57887-0_94
Bertot, Y., Castéran, P.: Interactive theorem proving and program development. In: Bertot, Y., Castéran, P. (eds.) Texts in Theoretical Computer Science. An EATCS Series, Springer, Berlin, Heidelberg (2004). https://doi.org/10.1007/978-3-662-07964-5
Claus, V., Ehrig, H., Rozenberg, G.: Graph-grammars and their application to computer science and biology. LNCS, vol. 73. Springer, Berlin, Heidelberg (1979). https://doi.org/10.1007/BFb0025713
Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of algebraic graph transformation. In: Ehrig, H., Ehrig, K., Prange, U., Taentzer, G. (eds.) Texts in Theoretical Computer Science. An EATCS Series, Springer, Berlin, Heidelberg (2006). https://doi.org/10.1007/3-540-31188-2
Ehrig, H., Engels, G., Kreowski, H.J., Rozenberg, G. (eds.): Handbook of Graph Grammars and Computing by Graph Transformation, vol. 2: Applications, Languages and Tools. World Scientific, Singapore (1999)
Ehrig, H., Kreowski, H.J., Montanari, U., Rozenberg, G. (eds.): Handbook of Graph Grammars and Computing by Graph Transformation, vol. 3: Concurrency, Parallelism, and Distribution. World Scientific, Singapore (1999)
Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A. (eds.): Graph Grammars 1986. LNCS, vol. 291. Springer, Heidelberg (1987). https://doi.org/10.1007/3-540-18771-5
Elliott, J., Turner, T., Clavisi, O., Thomas, J., Higgins, J., Mavergames, C., Gruen, R.: Living systematic reviews: an emerging opportunity to narrow the evidence-practice gap. PLoS Med. 11(2), e1001603 (2014)
Garner, R., Lack, S.: On the axioms for adhesive and quasiadhesive categories. Theory Appl. Categories 27(3), 27–46 (2012)
Harju, T., Petre, I., Rozenberg, G.: Tutorial on DNA computing and graph transformation. In: Corradini, A., Ehrig, H., Kreowski, H., Rozenberg, G. (eds.) Graph Transformation. ICGT 2002. LNCS, vol. 2505, pp. 430–434. Springer, Berlin, Heidelberg (2002)
Heckel, R., Taentzer, G.: Graph Transformation for Software Engineers. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-43916-3
Kohlhase, M., Rabe, F.: QED reloaded: towards a pluralistic formal library of mathematical knowledge. J. Formalized Reasoning 9(1), 201–234 (2016)
Lack, S., Sobociński, P.: Adhesive and quasiadhesive categories. RAIRO - Theor. Inform. Appl. 39(3), 511–545 (2005)
Pfaltz, J.L., Rosenfeld, A.: Web Grammars. In: Proceedings of the 1st International Joint Conference on Artificial Intelligence, pp. 609–619 (1969)
Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1: Foundations. World Scientific, Singapore (1997)
Schneider, H.J.: Chomsky-languages for multidimensional input-media. In: Proceedings of the International Computing Symposium, pp. 599–608 (1970)
Söldner, R., Plump, D.: Towards mechanised proofs in double-pushout graph transformation. In: Proceedings of GCM 2022, vol. 374, 59–75. EPTCS (2022)
Strecker, M.: Interactive and automated proofs for graph transformations. Math. Struct. Comput. Sci. 28(8), 1333–1362 (2018)
Wheary, J., Schutz, B.: Living reviews in relativity: making an electronic journal live. J. Electr. Publish. 3(1) (1997)
Wiedijk, F.: The QED manifesto revisited. Stud. Logic, Grammar Rhetoric 10(23), 121–133 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Behr, N., Harmer, R. (2023). A Living Monograph for Graph Transformation. In: Fernández, M., Poskitt, C.M. (eds) Graph Transformation. ICGT 2023. Lecture Notes in Computer Science, vol 13961. Springer, Cham. https://doi.org/10.1007/978-3-031-36709-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-031-36709-0_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-36708-3
Online ISBN: 978-3-031-36709-0
eBook Packages: Computer ScienceComputer Science (R0)