{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T04:45:59Z","timestamp":1782535559743,"version":"3.54.5"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032297297","type":"print"},{"value":"9783032297303","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-29730-3_7","type":"book-chapter","created":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T04:06:40Z","timestamp":1782533200000},"page":"129-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximately Compatible Graph Predicates"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Ferber","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7837-2611","authenticated-orcid":false,"given":"Ira","family":"Fesefeldt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1865-1798","authenticated-orcid":false,"given":"Thomas","family":"Noll","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emmett","family":"Rayes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,28]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-96142-2_1","volume-title":"Computer Aided Verification","author":"H Arndt","year":"2018","unstructured":"Arndt, H., Jansen, C., Katoen, J.-P., Matheja, C., Noll, T.: Let this graph be your witness! In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10982, pp. 3\u201311. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96142-2_1"},{"key":"7_CR2","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. The MIT Press (2008)"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Beyer, D., Henzinger, T.A., Theoduloz, G.: Program analysis with dynamic precision adjustment. In: 2008 23rd IEEE\/ACM International Conference on Automated Software Engineering, pp. 29\u201338 (2008). https:\/\/doi.org\/10.1109\/ASE.2008.13","DOI":"10.1109\/ASE.2008.13"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-030-45237-7_31","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Chalupa","year":"2020","unstructured":"Chalupa, M., et al.: Symbiotic 7: integration of predator and more. In: TACAS 2020. LNCS, vol. 12079, pp. 413\u2013417. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45237-7_31"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Chen, H.Y., David, C., Kroening, D., Schrammel, P., Wachter, B.: Bit-precise procedure-modular termination analysis. ACM Trans. Program. Lang. Syst. 40(1) (2017). https:\/\/doi.org\/10.1145\/3121136","DOI":"10.1145\/3121136"},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation frameworks. J. Log. Comput. 2(4), 511\u2013547 (1992). https:\/\/doi.org\/10.1093\/logcom\/2.4.511","journal-title":"J. Log. Comput."},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-540-87405-8_40","volume-title":"Graph Transformations","author":"M Dodds","year":"2008","unstructured":"Dodds, M.: From separation logic to hyperedge replacement and back. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 484\u2013486. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87405-8_40"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Drewes, F., Kreowski, H.J., Habel, A.: Hyperedge Replacement Graph Grammars, pp. 95\u2013162. World Scientific (1997). https:\/\/doi.org\/10.1142\/9789812384720_0002","DOI":"10.1142\/9789812384720_0002"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Ferber, A.: Combining integer programs and graph grammars: theory and implementation in Attestor. Bachelor\u2019s thesis, RWTH Aachen University, Aachen, Germany (2023). https:\/\/doi.org\/10.18154\/RWTH-2024-00784","DOI":"10.18154\/RWTH-2024-00784"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Fesefeldt, I.: Proving Termination of Pointer Programs on Top of Symbolic Execution. Master\u2019s thesis, RWTH Aachen University, Aachen, Germany (2019). https:\/\/doi.org\/10.18154\/RWTH-2020-04970","DOI":"10.18154\/RWTH-2020-04970"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-030-78946-6_15","volume-title":"Graph Transformation","author":"I Fesefeldt","year":"2021","unstructured":"Fesefeldt, I., Matheja, C., Noll, T., Schulte, J.: Automated checking and completion of backward confluence for hyperedge replacement grammars. In: Gadducci, F., Kehrer, T. (eds.) ICGT 2021. LNCS, vol. 12741, pp. 283\u2013293. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78946-6_15"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10817-016-9388-y","volume":"58","author":"J Giesl","year":"2016","unstructured":"Giesl, J., et al.: Analyzing program termination and complexity automatically with AProVE. J. Autom. Reason. 58(1), 3\u201331 (2016). https:\/\/doi.org\/10.1007\/s10817-016-9388-y","journal-title":"J. Autom. Reason."},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Habel, A.: Hyperedge Replacement: Grammars and Languages, 1st edn. Springer (1992). https:\/\/doi.org\/10.1007\/BFb0013875","DOI":"10.1007\/BFb0013875"},{"issue":"7","key":"7_CR14","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/bf00288976","volume":"26","author":"A Habel","year":"1989","unstructured":"Habel, A., Kreowski, H.J., Vogler, W.: Metatheorems for decision problems on hyperedge replacement graph languages. Acta Informatica 26(7), 657\u2013677 (1989). https:\/\/doi.org\/10.1007\/bf00288976","journal-title":"Acta Informatica"},{"issue":"2","key":"7_CR15","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10703-015-0236-1","volume":"47","author":"J Heinen","year":"2015","unstructured":"Heinen, J., Jansen, C., Katoen, J.-P., Noll, T.: Juggrnaut: using graph grammars for abstracting unbounded heap structures. Formal Methods Syst. Des. 47(2), 159\u2013203 (2015). https:\/\/doi.org\/10.1007\/s10703-015-0236-1","journal-title":"Formal Methods Syst. Des."},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-39799-8_2","volume-title":"Computer Aided Verification","author":"M Heizmann","year":"2013","unstructured":"Heizmann, M., Hoenicke, J., Podelski, A.: Software model checking for people who love automata. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 36\u201352. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_2"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Jansen, C.: Static Analysis of Pointer Programs - Linking Graph Grammars and Separation Logic. Ph.D. thesis, RWTH Aachen University (2017). https:\/\/doi.org\/10.18154\/RWTH-2017-09657","DOI":"10.18154\/RWTH-2017-09657"},{"issue":"1","key":"7_CR18","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"DB Johnson","year":"1975","unstructured":"Johnson, D.B.: Finding all the elementary circuits of a directed graph. SIAM J. Comput. 4(1), 77\u201384 (1975). https:\/\/doi.org\/10.1137\/0204007","journal-title":"SIAM J. Comput."},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Khalifa, M.: Termination analysis of procedural pointer programs modelled by graph grammars. Master thesis, RWTH Aachen University, Aachen, Germany (2022). https:\/\/doi.org\/10.18154\/RWTH-2022-09096","DOI":"10.18154\/RWTH-2022-09096"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-319-11737-9_18","volume-title":"Formal Methods and Software Engineering","author":"TC Le","year":"2014","unstructured":"Le, T.C., Gherghina, C., Hobor, A., Chin, W.-N.: A resource-based logic for termination and non-termination proofs. In: Merz, S., Pang, J. (eds.) ICFEM 2014. LNCS, vol. 8829, pp. 267\u2013283. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11737-9_18"},{"key":"7_CR21","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis, 2nd edn. Springer (2005)"},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"Rowe, R.N.S., Brotherston, J.: Automatic cyclic termination proofs for recursive procedures in separation logic. In: Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, CPP 2017, pp. 53\u201365. Association for Computing Machinery (2017). https:\/\/doi.org\/10.1145\/3018610.3018623","DOI":"10.1145\/3018610.3018623"}],"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-032-29730-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T04:06:42Z","timestamp":1782533202000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-29730-3_7"}},"subtitle":["Verifying Program Termination Using Graph Grammars"],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032297297","9783032297303"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-29730-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"28 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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":"Rennes","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/icgt-2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}