{"id":"https://openalex.org/W6884719183","doi":"https://doi.org/10.1184/r1/26380885.v1","title":"Leveraging Linearity to Improve Automatic Amortized Resource Analysis","display_name":"Leveraging Linearity to Improve Automatic Amortized Resource Analysis","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W6884719183","doi":"https://doi.org/10.1184/r1/26380885.v1"},"language":"en","primary_location":{"id":"pmh:oai:figshare.com:article/26380885","is_oa":true,"landing_page_url":"https://figshare.com/articles/thesis/Leveraging_Linearity_to_Improve_Automatic_Amortized_Resource_Analysis/26380885","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Thesis"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/thesis/Leveraging_Linearity_to_Improve_Automatic_Amortized_Resource_Analysis/26380885","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Kahn, David","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kahn, David","raw_affiliation_strings":["Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.33907285,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.36800000071525574,"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"}},"topics":[{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.36800000071525574,"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"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.14000000059604645,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.13449999690055847,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.8672000169754028},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.5622000098228455},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4180000126361847},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.41589999198913574},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.4099000096321106},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.3978999853134155},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.39579999446868896},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3776000142097473},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3603000044822693}],"concepts":[{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.8672000169754028},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.651199996471405},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.5622000098228455},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4205999970436096},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4180000126361847},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.41589999198913574},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.4099000096321106},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.3978999853134155},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.39579999446868896},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3776000142097473},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3603000044822693},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3483999967575073},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33340001106262207},{"id":"https://openalex.org/C198370458","wikidata":"https://www.wikidata.org/wiki/Q586459","display_name":"Type inference","level":3,"score":0.3192000091075897},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.3149000108242035},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.31139999628067017},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.2992999851703644},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2953000068664551},{"id":"https://openalex.org/C163175372","wikidata":"https://www.wikidata.org/wiki/Q3339222","display_name":"Linear model","level":2,"score":0.29019999504089355},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.28600001335144043},{"id":"https://openalex.org/C77170095","wikidata":"https://www.wikidata.org/wiki/Q1753188","display_name":"Linearity","level":2,"score":0.2847999930381775},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.2847000062465668},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.2784000039100647},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.27250000834465027},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27239999175071716},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2669999897480011},{"id":"https://openalex.org/C196697905","wikidata":"https://www.wikidata.org/wiki/Q2042052","display_name":"Input/output","level":2,"score":0.26350000500679016},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.25870001316070557},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.2542000114917755},{"id":"https://openalex.org/C138958017","wikidata":"https://www.wikidata.org/wiki/Q190087","display_name":"Data type","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:figshare.com:article/26380885","is_oa":true,"landing_page_url":"https://figshare.com/articles/thesis/Leveraging_Linearity_to_Improve_Automatic_Amortized_Resource_Analysis/26380885","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Thesis"},{"id":"doi:10.1184/r1/26380885.v1","is_oa":true,"landing_page_url":"https://doi.org/10.1184/r1/26380885.v1","pdf_url":null,"source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/26380885","is_oa":true,"landing_page_url":"https://figshare.com/articles/thesis/Leveraging_Linearity_to_Improve_Automatic_Amortized_Resource_Analysis/26380885","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Thesis"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.49277549982070923}],"awards":[{"id":"https://openalex.org/G2501181018","display_name":null,"funder_award_id":"1845514","funder_id":"https://openalex.org/F4320332169","funder_display_name":"Directorate for Computer and Information Science and Engineering"},{"id":"https://openalex.org/G2752163655","display_name":null,"funder_award_id":"1801369","funder_id":"https://openalex.org/F4320332169","funder_display_name":"Directorate for Computer and Information Science and Engineering"},{"id":"https://openalex.org/G3441756816","display_name":null,"funder_award_id":"2311983","funder_id":"https://openalex.org/F4320332169","funder_display_name":"Directorate for Computer and Information Science and Engineering"},{"id":"https://openalex.org/G491931281","display_name":null,"funder_award_id":"2007784","funder_id":"https://openalex.org/F4320332169","funder_display_name":"Directorate for Computer and Information Science and Engineering"},{"id":"https://openalex.org/G5111837372","display_name":null,"funder_award_id":"1812876","funder_id":"https://openalex.org/F4320332169","funder_display_name":"Directorate for Computer and Information Science and Engineering"}],"funders":[{"id":"https://openalex.org/F4320332169","display_name":"Directorate for Computer and Information Science and Engineering","ror":"https://ror.org/025kzpk63"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"After":[0],"correctness,":[1],"the":[2,32,47,70,180,186,203,219,226,233,242,246,257,273,334,344,354,376],"most":[3],"important":[4],"properties":[5],"of":[6,34,73,93,107,177,189,205,221,224,229,236,249,275,299,311,347,378,382],"programs":[7,106,292],"concern":[8],"their":[9,403],"resource":[10,37,62,89,113,289,366,371],"requirements,":[11],"like":[12,270],"how":[13,21],"much":[14,22],"time":[15],"they":[16,24],"take":[17],"to":[18,30,42,68,84,179,264,281,304,332,373,390,400],"run":[19],"or":[20],"memory":[23],"need.":[25],"It":[26],"is":[27,46,123,132,202,279,301,316,351,385],"therefore":[28],"desirable":[29],"automate":[31],"derivation":[33,45,188],"a":[35,111,175,327],"program\u2019s":[36,112],"requirements.":[38],"One":[39],"successful":[40],"approach":[41,331],"such":[43,171],"automatic":[44],"type":[48,182,231,258],"system":[49,183],"known":[50],"as":[51],"Automatic":[52],"Amortized":[53],"Resource":[54],"Analysis":[55],"(AARA).":[56],"AARA":[57,80,101,148,181,214,216,336],"finds":[58,149,156],"polynomial":[59],"bounds":[60,95,157,165,192,290,372],"on":[61,309,375],"usage":[63,114],"by":[64,173],"using":[65],"its":[66,230,237],"types":[67,337],"apply":[69],"physi?cist\u2019s":[71],"method":[72,248,346],"amortized":[74,250,348],"cost":[75,151,191,238,251,349,393],"analysis.":[76,90,252],"Type":[77],"inference":[78],"in":[79,103,120,218],"can":[81,117,287],"be":[82,118,305],"reduced":[83],"linear":[85,206,227,234,243],"programming,":[86],"thereby":[87],"automating":[88],"This":[91,168,253,297],"balance":[92],"expressive":[94],"and":[96,159,241,395],"efficient":[97,187],"analysis":[98,350],"has":[99],"brought":[100],"success":[102],"analyzing":[104,319],"various":[105,222,396],"interest.":[108],"Unfortunately,":[109],"deriving":[110],"(i.e.,":[115],"costs)":[116],"difficult\u2014":[119],"fact":[121],"it":[122,131,143,155,161],"generally":[124],"not":[125,133],"computable.":[126],"Thus,":[127],"despite":[128],"AARA\u2019s":[129,276],"success,":[130],"surprising":[134],"that":[135,142,184],"there":[136],"are":[137,398],"many":[138],"natural":[139],"program":[140],"patterns":[141],"cannot":[144,162],"analyze":[145],"well.":[146],"Sometimes":[147],"loose":[150],"bounds,":[152,285],"other":[153],"times":[154],"slowly,":[158],"sometimes":[160],"find":[163],"any":[164],"at":[166],"all.":[167],"thesis":[169],"addresses":[170],"shortcomings":[172],"developing":[174],"variety":[176],"upgrades":[178,201,256,384],"allow":[185],"tight":[190],"for":[193,291,318,363],"more":[194,328],"programs.":[195],"The":[196],"key":[197],"theme":[198],"underlying":[199],"these":[200,383],"leveraging":[204],"reasoning":[207,364],"principles.":[208],"These":[209],"ideas":[210],"integrate":[211],"well":[212],"with":[213,261,293,321,388],"because":[215],"exists":[217],"intersection":[220],"forms":[223],"linearity:":[225],"flavor":[228],"system,":[232],"relations":[235],"bound":[239],"templates,":[240],"physicality":[244],"behind":[245],"physicist\u2019s":[247,345,356],"work":[254,325],"first":[255],"system\u2019s":[259],"infrastructure":[260],"remainder":[262],"contexts":[263],"better":[265],"reason":[266],"about":[267,365],"reusable":[268],"resources":[269],"memory.":[271],"Then":[272],"class":[274,298],"bounding":[277],"functions":[278,300,320],"enlarged":[280,303],"include,":[282],"e.g.,":[283,340],"exponential":[284],"which":[286,315,358],"provide":[288],"multiple":[294],"recursive":[295],"calls.":[296],"further":[302],"multivariate,":[306],"allowing":[307,370],"dependence":[308],"products":[310],"data":[312,379],"structure":[313],"sizes,":[314],"critical":[317],"accumulators.":[322],"Next,":[323],"this":[324],"provides":[326,359],"efficient,":[329],"matrix-based":[330],"inferring":[333],"cost-free":[335],"needed":[338],"for,":[339],"non-tail":[341],"recursion.":[342],"Finally":[343],"refined":[352],"into":[353],"quantum":[355],"method,":[357],"an":[360,391],"automatable":[361],"framework":[362],"reallocation,":[367],"while":[368],"also":[369],"depend":[374],"height":[377],"structures.":[380],"Each":[381],"proven":[386],"sound":[387],"respect":[389],"operational":[392],"semantics,":[394],"implementations":[397],"made":[399],"empirically":[401],"evaluate":[402],"efficacy.":[404]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2025-10-10T00:00:00"}