{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:03:05Z","timestamp":1742986985663,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031367083"},{"type":"electronic","value":"9783031367090"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-36709-0_15","type":"book-chapter","created":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T18:03:02Z","timestamp":1689271382000},"page":"281-291","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Living Monograph for\u00a0Graph Transformation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8738-5040","authenticated-orcid":false,"given":"Nicolas","family":"Behr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0817-1029","authenticated-orcid":false,"given":"Russ","family":"Harmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,12]]},"reference":[{"key":"15_CR1","unstructured":"The QED manifesto. In: Bundy, A. (ed.) Automated Deduction - CADE-12. CADE 1994. LNCS, vol. 814, pp. 238\u2013251. Springer, Berlin, Heidelberg (1994)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-22673-1_10","volume-title":"Intelligent Computer Mathematics","author":"J Alama","year":"2011","unstructured":"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\u2013148. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22673-1_10"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Arias, E.J.G., Pin, B., Jouvelot, P.: jsCoq: towards hybrid theorem proving interfaces. In: Proceedings of UITP 2016, vol. 239, pp. 15\u201327. EPTCS (2017)","DOI":"10.4204\/EPTCS.239.2"},{"key":"15_CR4","unstructured":"Arsac, S.: Coq formalization of graph transformation. Master\u2019s thesis, Universit\u00e9 Paris-Cit\u00e9 (2022). https:\/\/www.samuelarsac.fr\/rapport22.pdf"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-45832-8_30","volume-title":"Graph Transformation","author":"L Baresi","year":"2002","unstructured":"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\u2013429. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45832-8_30"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-78946-6_1","volume-title":"Graph Transformation","author":"N Behr","year":"2021","unstructured":"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\u201321. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78946-6_1"},{"key":"15_CR7","unstructured":"Behr, N., Harmer, R., Krivine, J.: Fundamentals of compositional rewriting theory (2022). https:\/\/arxiv.org\/abs\/2204.07175"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/3-540-57887-0_94","volume-title":"Theoretical Aspects of Computer Software","author":"Y Bertot","year":"1994","unstructured":"Bertot, Y., Kahn, G., Th\u00e9ry, L.: Proof by pointing. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol. 789, pp. 141\u2013160. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-57887-0_94"},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive theorem proving and program development. In: Bertot, Y., Cast\u00e9ran, P. (eds.) Texts in Theoretical Computer Science. An EATCS Series, Springer, Berlin, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-662-07964-5","DOI":"10.1007\/978-3-662-07964-5"},{"key":"15_CR10","doi-asserted-by":"publisher","unstructured":"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","DOI":"10.1007\/BFb0025713"},{"key":"15_CR11","doi-asserted-by":"publisher","unstructured":"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","DOI":"10.1007\/3-540-31188-2"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1142\/4180"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1142\/4181"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-18771-5","volume-title":"Graph-Grammars and Their Application to Computer Science","year":"1987","unstructured":"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"},{"issue":"2","key":"15_CR15","doi-asserted-by":"publisher","first-page":"e1001603","DOI":"10.1371\/journal.pmed.1001603","volume":"11","author":"J Elliott","year":"2014","unstructured":"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)","journal-title":"PLoS Med."},{"issue":"3","key":"15_CR16","first-page":"27","volume":"27","author":"R Garner","year":"2012","unstructured":"Garner, R., Lack, S.: On the axioms for adhesive and quasiadhesive categories. Theory Appl. Categories 27(3), 27\u201346 (2012)","journal-title":"Theory Appl. Categories"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"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\u2013434. Springer, Berlin, Heidelberg (2002)","DOI":"10.1007\/3-540-45832-8_31"},{"key":"15_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-43916-3","volume-title":"Graph Transformation for Software Engineers","author":"R Heckel","year":"2020","unstructured":"Heckel, R., Taentzer, G.: Graph Transformation for Software Engineers. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43916-3"},{"issue":"1","key":"15_CR19","first-page":"201","volume":"9","author":"M Kohlhase","year":"2016","unstructured":"Kohlhase, M., Rabe, F.: QED reloaded: towards a pluralistic formal library of mathematical knowledge. J. Formalized Reasoning 9(1), 201\u2013234 (2016)","journal-title":"J. Formalized Reasoning"},{"issue":"3","key":"15_CR20","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1051\/ita:2005028","volume":"39","author":"S Lack","year":"2005","unstructured":"Lack, S., Soboci\u0144ski, P.: Adhesive and quasiadhesive categories. RAIRO - Theor. Inform. Appl. 39(3), 511\u2013545 (2005)","journal-title":"RAIRO - Theor. Inform. Appl."},{"key":"15_CR21","unstructured":"Pfaltz, J.L., Rosenfeld, A.: Web Grammars. In: Proceedings of the 1st International Joint Conference on Artificial Intelligence, pp. 609\u2013619 (1969)"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1: Foundations. World Scientific, Singapore (1997)","DOI":"10.1142\/3303"},{"key":"15_CR23","unstructured":"Schneider, H.J.: Chomsky-languages for multidimensional input-media. In: Proceedings of the International Computing Symposium, pp. 599\u2013608 (1970)"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"S\u00f6ldner, R., Plump, D.: Towards mechanised proofs in double-pushout graph transformation. In: Proceedings of GCM 2022, vol. 374, 59\u201375. EPTCS (2022)","DOI":"10.4204\/EPTCS.374.6"},{"issue":"8","key":"15_CR25","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1017\/S096012951800021X","volume":"28","author":"M Strecker","year":"2018","unstructured":"Strecker, M.: Interactive and automated proofs for graph transformations. Math. Struct. Comput. Sci. 28(8), 1333\u20131362 (2018)","journal-title":"Math. Struct. Comput. Sci."},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Wheary, J., Schutz, B.: Living reviews in relativity: making an electronic journal live. J. Electr. Publish. 3(1) (1997)","DOI":"10.3998\/3336451.0003.105"},{"issue":"23","key":"15_CR27","first-page":"121","volume":"10","author":"F Wiedijk","year":"2007","unstructured":"Wiedijk, F.: The QED manifesto revisited. Stud. Logic, Grammar Rhetoric 10(23), 121\u2013133 (2007)","journal-title":"Stud. Logic, Grammar Rhetoric"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36709-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T18:04:18Z","timestamp":1689271458000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36709-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031367083","9783031367090"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36709-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"12 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Graph Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leicester","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/icgt-2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.78","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}