{"id":"https://openalex.org/W2408755413","doi":"https://doi.org/10.1017/s0956796815000192","title":"Type-based amortized resource analysis with integers and arrays","display_name":"Type-based amortized resource analysis with integers and arrays","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2408755413","doi":"https://doi.org/10.1017/s0956796815000192","mag":"2408755413"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796815000192","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796815000192","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B226DB9379DAF00F7BD7992283CEA906/S0956796815000192a.pdf/div-class-title-type-based-amortized-resource-analysis-with-integers-and-arrays-a-href-afn1-ref-type-fn-a-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B226DB9379DAF00F7BD7992283CEA906/S0956796815000192a.pdf/div-class-title-type-based-amortized-resource-analysis-with-integers-and-arrays-a-href-afn1-ref-type-fn-a-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101496943","display_name":"Jan Hoffmann","orcid":"https://orcid.org/0000-0001-8326-0788"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"JAN HOFFMANN","raw_affiliation_strings":["Department of Computer Science, Yale University, 51 Prospect St., New Haven, CT 06511, USA (e-mail:","Yale University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Yale University, 51 Prospect St., New Haven, CT 06511, USA (e-mail:","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"Yale University","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070627140","display_name":"Zhong Shao","orcid":"https://orcid.org/0000-0001-8184-7649"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"ZHONG SHAO","raw_affiliation_strings":["Department of Computer Science, Yale University, 51 Prospect St., New Haven, CT 06511, USA (e-mail:","Yale University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Yale University, 51 Prospect St., New Haven, CT 06511, USA (e-mail:","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"Yale University","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":null,"apc_paid":null,"fwci":2.1175,"has_fulltext":true,"cited_by_count":15,"citation_normalized_percentile":{"value":0.88627374,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"25","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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.9994999766349792,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.9681926965713501},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8041974306106567},{"id":"https://openalex.org/keywords/abstract-interpretation","display_name":"Abstract interpretation","score":0.7596114873886108},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.5512625575065613},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.5421844124794006},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.47007519006729126},{"id":"https://openalex.org/keywords/static-analysis","display_name":"Static analysis","score":0.4679830074310303},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.45169660449028015},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4363030195236206},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.42997950315475464},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.41111618280410767},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40083181858062744},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3523765206336975}],"concepts":[{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.9681926965713501},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8041974306106567},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.7596114873886108},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.5512625575065613},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.5421844124794006},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.47007519006729126},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.4679830074310303},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.45169660449028015},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4363030195236206},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.42997950315475464},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.41111618280410767},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40083181858062744},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3523765206336975}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0956796815000192","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796815000192","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B226DB9379DAF00F7BD7992283CEA906/S0956796815000192a.pdf/div-class-title-type-based-amortized-resource-analysis-with-integers-and-arrays-a-href-afn1-ref-type-fn-a-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s0956796815000192","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796815000192","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B226DB9379DAF00F7BD7992283CEA906/S0956796815000192a.pdf/div-class-title-type-based-amortized-resource-analysis-with-integers-and-arrays-a-href-afn1-ref-type-fn-a-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5600000023841858,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2408755413.pdf","grobid_xml":"https://content.openalex.org/works/W2408755413.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W30585784","https://openalex.org/W80790317","https://openalex.org/W82233118","https://openalex.org/W1230660382","https://openalex.org/W1515621470","https://openalex.org/W1523037784","https://openalex.org/W1570919259","https://openalex.org/W1595456961","https://openalex.org/W1598436734","https://openalex.org/W1636902686","https://openalex.org/W2002842561","https://openalex.org/W2008772536","https://openalex.org/W2052294925","https://openalex.org/W2058033966","https://openalex.org/W2068055184","https://openalex.org/W2073629816","https://openalex.org/W2094712524","https://openalex.org/W2101953483","https://openalex.org/W2111366004","https://openalex.org/W2134589411","https://openalex.org/W2155466296","https://openalex.org/W2159373783","https://openalex.org/W3003830046","https://openalex.org/W4236752279","https://openalex.org/W4240835555","https://openalex.org/W4242321992"],"related_works":["https://openalex.org/W2318743569","https://openalex.org/W2752947237","https://openalex.org/W2408755413","https://openalex.org/W4293327716","https://openalex.org/W3037094428","https://openalex.org/W82233118","https://openalex.org/W2040934527","https://openalex.org/W4301262063","https://openalex.org/W1831964350","https://openalex.org/W1967226206"],"abstract_inverted_index":{"Abstract":[0],"Proving":[1],"bounds":[2,38,95],"on":[3,39],"the":[4,72,77,101,104,107,110],"resource":[5,65],"consumption":[6],"of":[7,44,74,106,120],"a":[8,68,82],"program":[9],"by":[10],"statically":[11],"analyzing":[12],"its":[13],"source":[14],"code":[15],"is":[16,79,154],"an":[17,50],"important":[18],"and":[19,41,58,89,103,156],"well-studied":[20],"problem.":[21],"Automatic":[22],"approaches":[23],"for":[24,56,81,159],"numeric":[25,57],"programs":[26,60,115,135,161],"with":[27,86,113,136],"side":[28],"effects":[29],"usually":[30],"apply":[31],"abstract":[32,125],"interpretation-based":[33],"invariant":[34],"generation":[35],"to":[36,53],"derive":[37],"loops":[40],"recursion":[42],"depths":[43],"function":[45],"calls.":[46],"This":[47],"article":[48],"presents":[49],"alternative":[51],"approach":[52],"resource-bound":[54],"analysis":[55,73,92,122,132,153],"heap-manipulating":[59],"that":[61,96],"uses":[62],"type-based":[63],"amortized":[64,121,131,152],"analysis.":[66],"As":[67],"first":[69],"step":[70],"towards":[71],"imperative":[75],"code,":[76],"technique":[78],"developed":[80],"first-order":[83],"ML-like":[84],"language":[85],"unsigned":[87],"integers":[88],"arrays.":[90],"The":[91],"automatically":[93],"derives":[94],"are":[97],"multivariate":[98],"polynomials":[99],"in":[100,109],"numbers":[102],"lengths":[105],"arrays":[108],"input.":[111],"Experiments":[112],"example":[114],"demonstrate":[116],"two":[117],"main":[118],"advantages":[119],"over":[123],"current":[124],"interpretation\u2013based":[126],"techniques.":[127],"For":[128,149],"one":[129],"thing,":[130,151],"can":[133],"handle":[134],"non-linear":[137],"intermediate":[138],"values":[139],"like":[140,162],"f":[141,163],"((":[142],"n":[143],"+":[144],"m":[145],")":[146],"2":[147],").":[148],"another":[150],"compositional":[155],"works":[157],"naturally":[158],"compound":[160],"(":[164,166],"g":[165],"x":[167],")).":[168]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-27T06:14:07.914337","created_date":"2025-10-10T00:00:00"}