{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:23Z","timestamp":1750220663754,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T00:00:00Z","timestamp":1584921600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,3,23]]},"DOI":"10.1145\/3397537.3397564","type":"proceedings-article","created":{"date-parts":[[2020,8,4]],"date-time":"2020-08-04T22:14:14Z","timestamp":1596579254000},"page":"41-45","source":"Crossref","is-referenced-by-count":1,"title":["Toward presizing and pretransitioning strategies for GraalPython"],"prefix":"10.1145","author":[{"given":"Johannes","family":"Henning","sequence":"first","affiliation":[{"name":"HPI, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Felgentreff","sequence":"additional","affiliation":[{"name":"Oracle Labs, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Niephaus","sequence":"additional","affiliation":[{"name":"HPI, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Hirschfeld","sequence":"additional","affiliation":[{"name":"HPI, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1929501.1929508"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2509136.2509531"},{"volume-title":"Memento Mori: Dynamic Allocation-site-based Optimizations. In ACM SIGPLAN Notices","year":"2015","author":"Clifford Daniel","key":"e_1_3_2_1_3_1"},{"volume-title":"The DeltaBlue Algorithm: An Incremental Constraint Hierarchy Solver. In Eighth Annual International Phoenix Conference on Computers and Communications. 1989 Conference Proceedings. IEEE, 538\u2013542","year":"1989","author":"Freeman-Benson Bjorn N","key":"e_1_3_2_1_4_1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542528"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132190.3132202"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2989225.2989232"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357390.3361024"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2816707.2816716"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2509578.2509581"}],"event":{"name":"<Programming> '20: 4th International Conference on the Art, Science, and Engineering of Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"Porto Portugal","acronym":"<Programming> '20"},"container-title":["Conference Companion of the 4th International Conference on Art, Science, and Engineering of Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397537.3397564","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3397537.3397564","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:45Z","timestamp":1750197765000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397537.3397564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,23]]},"references-count":10,"alternative-id":["10.1145\/3397537.3397564","10.1145\/3397537"],"URL":"https:\/\/doi.org\/10.1145\/3397537.3397564","relation":{},"subject":[],"published":{"date-parts":[[2020,3,23]]}}}