{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T22:59:38Z","timestamp":1769468378051,"version":"3.49.0"},"reference-count":6,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.440.2","type":"journal-article","created":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T18:42:32Z","timestamp":1767724952000},"page":"6-12","source":"Crossref","is-referenced-by-count":0,"title":["Implementing Binary Search Trees in GP 2 (Extended Abstract)"],"prefix":"10.4204","volume":"440","author":[{"given":"Ziad","family":"Ismaili Alaoui","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Liverpool, Liverpool, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Detlef","family":"Plump","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of York, York, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2720","published-online":{"date-parts":[[2026,1,26]]},"reference":[{"issue":"1","key":"A-E-H-H-K-K-P-S-T98a","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6423(98)00023-9","article-title":"Graph Transformation for Specification and Programming","volume":"34","author":"Andries","year":"1999","journal-title":"Science of Computer Programming"},{"key":"Baldan-Corradini-Esparza-Heindel-Koenig-Kozioura05a","first-page":"1","article-title":"Verifying Red-Black Trees","volume-title":"Workshop on Verification of Concurrent Systems with Dynamic Allocated Heaps (COSMICAH 2005)","author":"Baldan","year":"2005"},{"key":"campbell2022fast","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2021.102727","article-title":"Fast Rule-Based Graph Programs","volume":"214","author":"Campbell","year":"2022","journal-title":"Science of Computer Programming"},{"key":"Poskitt-Plump23a","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2022.100825","article-title":"Monadic Second-Order Incorrectness Logic for GP\\,2","volume":"130","author":"Poskitt","year":"2023","journal-title":"Journal of Logical and Algebraic Methods in Programming"},{"key":"Skiena20a","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-54256-6","volume-title":"The Algorithm Design Manual","author":"Skiena","year":"2020"},{"key":"Wulandari-Plump21a","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-030-78946-6_13","article-title":"Verifying Graph Programs with Monadic Second-Order Logic","volume-title":"Proc. 14th International Conference on Graph Transformation (ICGT 2021)","volume":"12741","author":"Wulandari","year":"2021"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T12:52:02Z","timestamp":1769431922000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/2601.03897v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,26]]},"references-count":6,"URL":"https:\/\/doi.org\/10.4204\/eptcs.440.2","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,26]]}}}