{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:34:53Z","timestamp":1750307693980,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,19]],"date-time":"2009-06-19T00:00:00Z","timestamp":1245369600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,6,19]]},"DOI":"10.1145\/1542431.1542451","type":"proceedings-article","created":{"date-parts":[[2009,6,24]],"date-time":"2009-06-24T21:59:19Z","timestamp":1245880759000},"page":"139-148","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Parametric heap usage analysis for functional programs"],"prefix":"10.1145","author":[{"given":"Leena","family":"Unnikrishnan","sequence":"first","affiliation":[{"name":"Stony Brook University, Stony Brook, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott D.","family":"Stoller","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,6,19]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1007\/978-3-540-69166-2_15"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/1296907.1296922"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/1542431.1542450"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1007\/978-3-540-30569-9_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/1217256.1217268"},{"unstructured":"R. Bagnara A. Pescetti A. Zaccagnini E. Zaffanella and T. Zolo. PURRS: The Parma University's recurrence relation solver. http: \/\/www.cs.unipr.it\/purrs.  R. Bagnara A. Pescetti A. Zaccagnini E. Zaffanella and T. Zolo. PURRS: The Parma University's recurrence relation solver. http: \/\/www.cs.unipr.it\/purrs.","key":"e_1_3_2_1_6_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1109\/SEFM.2005.34"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/1375634.1375655"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1007\/11526841_8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/1375634.1375656"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1007\/11547662_7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/325694.325716"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/1140389.1140392"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/325478.325479"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/1480881.1480898"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/604131.604148"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/317636.317785"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1145\/237721.240882"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1145\/42190.42347"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.5555\/646905.710482"},{"key":"e_1_3_2_1_21_1","volume-title":"Maplesoft","author":"Monagan M. B.","year":"2005","unstructured":"M. B. Monagan , K. O. Geddes , K. M. Heal , G. Labahn , S. M. Vorkoetter , J. McCarron , and P. DeMarco . Maple 10 Programming Guide . Maplesoft , 2005 . M. B. Monagan, K. O. Geddes, K. M. Heal, G. Labahn, S. M. Vorkoetter, J. McCarron, and P. DeMarco. Maple 10 Programming Guide. Maplesoft, 2005."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/99370.99381"},{"key":"e_1_3_2_1_23_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/3-540-52592-0_74","volume-title":"Proceedings of the 3rd European Symposium on Programming","author":"Sands D.","year":"1990","unstructured":"D. Sands . Complexity analysis for a lazy higher-order language . In N. D. Jones, editor, Proceedings of the 3rd European Symposium on Programming , volume 432 of Lecture Notes in Computer Science , pages 361 -- 376 . Springer-Verlag, Berlin , May 1990 . D. Sands. Complexity analysis for a lazy higher-order language. In N. D. Jones, editor, Proceedings of the 3rd European Symposium on Programming, volume 432 of Lecture Notes in Computer Science, pages 361--376. Springer-Verlag, Berlin, May 1990."},{"key":"e_1_3_2_1_24_1","volume-title":"Stony Brook University","author":"Unnikrishnan L.","year":"2008","unstructured":"L. Unnikrishnan . Automatic Live Memory Bound Analysis for High-Level Languages. PhD thesis , Stony Brook University , 2008 . Available at http:\/\/www.cs.sunysb.edu\/~leena\/thesis.pdf. L. Unnikrishnan. Automatic Live Memory Bound Analysis for High-Level Languages. PhD thesis, Stony Brook University, 2008. Available at http:\/\/www.cs.sunysb.edu\/~leena\/thesis.pdf."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.5555\/646542.696211"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/361002.361016"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the ACM SIGPLAN 1998 Workshop on Languages, Compilers, and Tools for Embedded Systems","volume":"1474","author":"Wilhelm R.","year":"1998","unstructured":"R. Wilhelm and C. Ferdinand . On predicting data cache behaviour for real-time systems . In Proceedings of the ACM SIGPLAN 1998 Workshop on Languages, Compilers, and Tools for Embedded Systems , volume 1474 of Lecture Notes in Computer Science, pages 16--30. Springer-Verlag , 1998 . R. Wilhelm and C. Ferdinand. On predicting data cache behaviour for real-time systems. In Proceedings of the ACM SIGPLAN 1998 Workshop on Languages, Compilers, and Tools for Embedded Systems, volume 1474 of Lecture Notes in Computer Science, pages 16--30. Springer-Verlag, 1998."}],"event":{"sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"],"acronym":"ISMM '09","name":"ISMM '09: International Symposium on Memory Management","location":"Dublin Ireland"},"container-title":["Proceedings of the 2009 international symposium on Memory management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1542431.1542451","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1542431.1542451","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:56Z","timestamp":1750253396000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1542431.1542451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,19]]},"references-count":27,"alternative-id":["10.1145\/1542431.1542451","10.1145\/1542431"],"URL":"https:\/\/doi.org\/10.1145\/1542431.1542451","relation":{},"subject":[],"published":{"date-parts":[[2009,6,19]]},"assertion":[{"value":"2009-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}