{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T17:59:54Z","timestamp":1771264794907,"version":"3.50.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031098420","type":"print"},{"value":"9783031098437","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09843-7_9","type":"book-chapter","created":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T18:04:44Z","timestamp":1656612284000},"page":"155-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computational Category-Theoretic Rewriting"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9374-9138","authenticated-orcid":false,"given":"Kristopher","family":"Brown","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8600-949X","authenticated-orcid":false,"given":"Evan","family":"Patterson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tyler","family":"Hanks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1778-3350","authenticated-orcid":false,"given":"James","family":"Fairbanks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,26]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-319-75396-6_9","volume-title":"Graph Transformation, Specifications, and Nets","author":"GG Azzi","year":"2018","unstructured":"Azzi, G.G., Bezerra, J.S., Ribeiro, L., Costa, A., Rodrigues, L.M., Machado, R.: The verigraph system for graph transformation. In: Heckel, R., Taentzer, G. (eds.) Graph Transformation, Specifications, and Nets. LNCS, vol. 10800, pp. 160\u2013178. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-75396-6_9"},{"key":"9_CR2","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":"9_CR3","unstructured":"Bonchi, F., Gadducci, F., Kissinger, A., Sobocinski, P., Zanasi, F.: String diagram rewrite theory I: rewriting with Frobenius structure. arXiv preprint arXiv:2012.01847 (2020)"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.jsc.2010.09.007","volume":"46","author":"B Braatz","year":"2011","unstructured":"Braatz, B., Golas, U., Soboll, T.: How to delete categorically-two pushout complement constructions. J. Symb. Comput. 46(3), 246\u2013271 (2011)","journal-title":"J. Symb. Comput."},{"issue":"4","key":"9_CR5","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s41019-019-00110-3","volume":"4","author":"Y Cheng","year":"2019","unstructured":"Cheng, Y., Ding, P., Wang, T., Lu, W., Du, X.: Which category is better: benchmarking relational and graph database management systems. Data Sci. Eng. 4(4), 309\u2013322 (2019). https:\/\/doi.org\/10.1007\/s41019-019-00110-3","journal-title":"Data Sci. Eng."},{"key":"9_CR6","unstructured":"Cicala, D.: Rewriting structured cospans: A syntax for open systems. arXiv preprint arXiv:1906.05443 (2019)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-21145-9_3","volume-title":"Graph Transformation","author":"A Corradini","year":"2015","unstructured":"Corradini, A., Duval, D., Echahed, R., Prost, F., Ribeiro, L.: AGREE \u2013 algebraic graph rewriting with controlled embedding. In: Parisi-Presicce, F., Westfechtel, B. (eds.) ICGT 2015. LNCS, vol. 9151, pp. 35\u201351. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21145-9_3"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/11841883_4","volume-title":"Graph Transformations","author":"A Corradini","year":"2006","unstructured":"Corradini, A., Heindel, T., Hermann, F., K\u00f6nig, B.: Sesqui-pushout rewriting. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 30\u201345. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11841883_4"},{"issue":"3, 4","key":"9_CR9","first-page":"241","volume":"26","author":"A Corradini","year":"1996","unstructured":"Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fund. Inform. 26(3, 4), 241\u2013265 (1996)","journal-title":"Fund. Inform."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Pfender, M., Schneider, H.J.: Graph-grammars: an algebraic approach. In: 14th Annual Symposium on Switching and Automata Theory (SWAT 1973), pp. 167\u2013180. IEEE (1973)","DOI":"10.1109\/SWAT.1973.11"},{"key":"9_CR11","unstructured":"Halter, M., Patterson, E., Baas, A., Fairbanks, J.: Compositional scientific computing with Catlab and SemanticModels. arXiv preprint arXiv:2005.04831 (2020)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Harmer, R., Oshurko, E.: Reversibility and composition of rewriting in hierarchies. arXiv preprint arXiv:2012.01661 (2020)","DOI":"10.4204\/EPTCS.330.9"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-37075-5_1","volume-title":"Foundations of Software Science and Computation Structures","author":"J Hayman","year":"2013","unstructured":"Hayman, J., Heindel, T.: Pattern graphs and rule-based models: the semantics of kappa. In: Pfenning, F. (ed.) FoSSaCS 2013. LNCS, vol. 7794, pp. 1\u201316. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37075-5_1"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Heckel, R., Lambers, L., Saadat, M.G.: Analysis of graph transformation systems: native vs translation-based techniques. arXiv preprint arXiv:1912.09607 (2019)","DOI":"10.4204\/EPTCS.309.1"},{"key":"9_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-27950-4","volume-title":"Categories and Sheaves","author":"M Kashiwara","year":"2006","unstructured":"Kashiwara, M., Schapira, P.: Categories and Sheaves. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-27950-4"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/BFb0017408","volume-title":"Graph Grammars and Their Application to Computer Science","author":"R Kennaway","year":"1991","unstructured":"Kennaway, R.: Graph rewriting in some categories of partial morphisms. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graph Grammars 1990. LNCS, vol. 532, pp. 490\u2013504. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0017408"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-24727-2_20","volume-title":"Foundations of Software Science and Computation Structures","author":"S Lack","year":"2004","unstructured":"Lack, S., Soboci\u0144ski, P.: Adhesive categories. In: Walukiewicz, I. (ed.) FoSSaCS 2004. LNCS, vol. 2987, pp. 273\u2013288. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24727-2_20"},{"issue":"3","key":"9_CR18","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."},{"issue":"1\u20132","key":"9_CR19","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(93)90068-5","volume":"109","author":"M L\u00f6we","year":"1993","unstructured":"L\u00f6we, M.: Algebraic approach to single-pushout graph transformation. Theor. Comput. Sci. 109(1\u20132), 181\u2013224 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-17322-6_3","volume-title":"Graph Transformations and Model-Driven Engineering","author":"M Minas","year":"2010","unstructured":"Minas, M., Schneider, H.J.: Graph transformation by computational category theory. In: Engels, G., Lewerentz, C., Sch\u00e4fer, W., Sch\u00fcrr, A., Westfechtel, B. (eds.) Graph Transformations and Model-Driven Engineering. LNCS, vol. 5765, pp. 33\u201358. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17322-6_3"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Patterson, E., Lynch, O., Fairbanks, J.: Categorical data structures for technical computing. arXiv preprint arXiv:2106.04703 (2021)","DOI":"10.32408\/compositionality-4-5"},{"key":"9_CR22","unstructured":"Peschke, G., Tholen, W.: Diagrams, fibrations, and the decomposition of colimits. arXiv preprint arXiv:2006.10890 (2020)"},{"key":"9_CR23","unstructured":"Rensink, A., Boneva, I., Kastenberg, H., Staijen, T.: User manual for the groove tool set. University of Twente, The Netherlands, Department of Computer Science (2010)"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Ringer, T., Palmskog, K., Sergey, I., Gligoric, M., Tatlock, Z.: QED at large: a survey of engineering of formally verified software. arXiv preprint arXiv:2003.06458 (2020)","DOI":"10.1561\/9781680835953"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-69149-5_18","volume-title":"Verified Software: Theories, Tools, Experiments","author":"J Rushby","year":"2008","unstructured":"Rushby, J.: Automated test generation and verified software. In: Meyer, B., Woodcock, J. (eds.) VSTTE 2005. LNCS, vol. 4171, pp. 161\u2013172. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69149-5_18"},{"key":"9_CR26","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach (2010)"},{"key":"9_CR27","unstructured":"Schultz, P., Spivak, D.I., Vasilakopoulou, C., Wisnesky, R.: Algebraic databases. arXiv preprint arXiv:1602.03501 (2016)"},{"key":"9_CR28","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ic.2012.05.001","volume":"217","author":"DI Spivak","year":"2012","unstructured":"Spivak, D.I.: Functorial data migration. Inf. Comput. 217, 31\u201351 (2012). https:\/\/doi.org\/10.1016\/j.ic.2012.05.001","journal-title":"Inf. Comput."},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-540-25959-6_35","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"G Taentzer","year":"2004","unstructured":"Taentzer, G.: AGG: a\u00a0graph transformation environment for modeling and validation of software. In: Pfaltz, J.L., Nagl, M., B\u00f6hlen, B. (eds.) AGTIVE 2003. LNCS, vol. 3062, pp. 446\u2013453. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25959-6_35"},{"key":"9_CR30","doi-asserted-by":"publisher","unstructured":"Vardi, M.Y.: Constraint satisfaction and database theory: a tutorial. In: Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 76\u201385 (2000). https:\/\/doi.org\/10.1145\/335168.335209","DOI":"10.1145\/335168.335209"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Willsey, M., Nandi, C., Wang, Y.R., Flatt, O., Tatlock, Z., Panchekha, P.: EGG: fast and extensible equality saturation. Proc. ACM Program. Lang. 5(POPL), 1\u201329 (2021)","DOI":"10.1145\/3434304"}],"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-09843-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T08:21:00Z","timestamp":1676017260000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09843-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031098420","9783031098437"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09843-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"26 June 2022","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":"Nantes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2022","order":10,"name":"conference_id","label":"Conference ID","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":"19","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":"10","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":"1","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":"53% - 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":"2,2","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)"}}]}}