{"id":"https://openalex.org/W2138433203","doi":"https://doi.org/10.1145/1542431.1542451","title":"Parametric heap usage analysis for functional programs","display_name":"Parametric heap usage analysis for functional programs","publication_year":2009,"publication_date":"2009-06-19","ids":{"openalex":"https://openalex.org/W2138433203","doi":"https://doi.org/10.1145/1542431.1542451","mag":"2138433203"},"language":"en","primary_location":{"id":"doi:10.1145/1542431.1542451","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1542431.1542451","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 international symposium on Memory management","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018260240","display_name":"Leena Unnikrishnan","orcid":null},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Leena Unnikrishnan","raw_affiliation_strings":["Stony Brook University, Stony Brook, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stony Brook University, Stony Brook, USA","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021474885","display_name":"Scott D. Stoller","orcid":"https://orcid.org/0000-0002-8824-6835"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Scott D. Stoller","raw_affiliation_strings":["Stony Brook University, Stony Brook, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stony Brook University, Stony Brook, USA","institution_ids":["https://openalex.org/I59553526"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.8999,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.9375264,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"139","last_page":"148"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.9023223519325256},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6769278049468994},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.6221127510070801},{"id":"https://openalex.org/keywords/garbage-collection","display_name":"Garbage collection","score":0.5835452079772949},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.544920802116394},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.5367352366447449},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.5096442699432373},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4317147433757782},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4116992950439453},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37570691108703613},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31285467743873596},{"id":"https://openalex.org/keywords/garbage","display_name":"Garbage","score":0.28824442625045776},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.25250643491744995},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07301712036132812}],"concepts":[{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.9023223519325256},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6769278049468994},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.6221127510070801},{"id":"https://openalex.org/C105122174","wikidata":"https://www.wikidata.org/wiki/Q322202","display_name":"Garbage collection","level":3,"score":0.5835452079772949},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.544920802116394},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.5367352366447449},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.5096442699432373},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4317147433757782},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4116992950439453},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37570691108703613},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31285467743873596},{"id":"https://openalex.org/C75403996","wikidata":"https://www.wikidata.org/wiki/Q5521979","display_name":"Garbage","level":2,"score":0.28824442625045776},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.25250643491744995},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07301712036132812},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1542431.1542451","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1542431.1542451","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 international symposium on Memory management","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1482836859","https://openalex.org/W1510778512","https://openalex.org/W1525599808","https://openalex.org/W1557490801","https://openalex.org/W1563352283","https://openalex.org/W1567423028","https://openalex.org/W1981525818","https://openalex.org/W1983134029","https://openalex.org/W2003172590","https://openalex.org/W2003295303","https://openalex.org/W2029470010","https://openalex.org/W2051600983","https://openalex.org/W2055814018","https://openalex.org/W2058898825","https://openalex.org/W2060213695","https://openalex.org/W2066550846","https://openalex.org/W2068055184","https://openalex.org/W2109863363","https://openalex.org/W2119688369","https://openalex.org/W2121707639","https://openalex.org/W2127184104","https://openalex.org/W2135909143","https://openalex.org/W2158737060","https://openalex.org/W2167789628","https://openalex.org/W2171496589","https://openalex.org/W2611406955","https://openalex.org/W4248151333","https://openalex.org/W4285719527","https://openalex.org/W6607548779"],"related_works":["https://openalex.org/W1700460898","https://openalex.org/W1524351898","https://openalex.org/W4297378365","https://openalex.org/W2524496484","https://openalex.org/W1487406077","https://openalex.org/W2147299991","https://openalex.org/W1588734579","https://openalex.org/W4250131244","https://openalex.org/W2148255588","https://openalex.org/W2335513707"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3],"analysis":[4,110],"that":[5,38,134],"derives":[6],"a":[7,19],"formula":[8],"describing":[9],"the":[10,29,43,56,77,81,96,132],"worst-case":[11,82],"live":[12,44],"heap":[13,45,126],"space":[14,46,51,83,139],"usage":[15,47],"of":[16,55,58,95,106,118,131],"programs":[17],"in":[18,53],"functional":[20],"language":[21],"with":[22],"automated":[23],"memory":[24],"management":[25],"(garbage":[26],"collection).":[27],"First,":[28],"given":[30],"program":[31,133],"is":[32],"automatically":[33,103],"transformed":[34],"into":[35],"bound":[36,62,119],"functions":[37,63,120],"describe":[39],"upper":[40,123],"bounds":[41,124],"on":[42,125],"and":[48,66,112,115],"other":[49],"related":[50],"metrics":[52],"terms":[54],"sizes":[57],"function":[59],"arguments.":[60],"The":[61],"are":[64,72],"simplified":[65],"rewritten":[67],"to":[68,75,90,93,102,121,137],"obtain":[69,76],"recurrences,":[70],"which":[71],"then":[73],"solved":[74],"desired":[78],"formulas":[79],"characterizing":[80],"usage.":[84,140],"These":[85],"recurrences":[86],"may":[87],"be":[88],"difficult":[89],"solve":[91,104],"due":[92],"uses":[94],"maximum":[97],"operator.":[98],"We":[99],"give":[100],"methods":[101],"categories":[105],"such":[107],"recurrences.":[108],"Our":[109],"determines":[111],"exploits":[113],"monotonicity":[114],"monotonicity-like":[116],"properties":[117],"derive":[122],"usage,":[127],"without":[128],"considering":[129],"behaviors":[130],"cannot":[135],"lead":[136],"maximal":[138]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}