{"id":"https://openalex.org/W2109863363","doi":"https://doi.org/10.1145/1480881.1480898","title":"SPEED","display_name":"SPEED","publication_year":2009,"publication_date":"2009-01-20","ids":{"openalex":"https://openalex.org/W2109863363","doi":"https://doi.org/10.1145/1480881.1480898","mag":"2109863363"},"language":"en","primary_location":{"id":"doi:10.1145/1480881.1480898","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1480881.1480898","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","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/A5011543162","display_name":"Sumit Gulwani","orcid":"https://orcid.org/0000-0002-9226-9634"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sumit Gulwani","raw_affiliation_strings":["Microsoft, Redmond, WA, USA","Microsoft Redmond, WA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Microsoft, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Redmond, WA, USA#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029880614","display_name":"Krishna K. Mehra","orcid":null},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Krishna K. Mehra","raw_affiliation_strings":["Microsoft, Bangalore, India"],"affiliations":[{"raw_affiliation_string":"Microsoft, Bangalore, India","institution_ids":["https://openalex.org/I4210124949"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013670321","display_name":"Trishul Chilimbi","orcid":"https://orcid.org/0000-0001-6711-1117"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Trishul Chilimbi","raw_affiliation_strings":["Microsoft, Redmond, WA, USA","Microsoft Redmond, WA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Microsoft, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Redmond, WA, USA#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5011543162"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":33.8274,"has_fulltext":false,"cited_by_count":269,"citation_normalized_percentile":{"value":0.999271,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"127","last_page":"139"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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.9997000098228455,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9984999895095825,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5486841201782227}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5486841201782227}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1480881.1480898","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1480881.1480898","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","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":35,"referenced_works":["https://openalex.org/W1492171827","https://openalex.org/W1500138362","https://openalex.org/W1502028089","https://openalex.org/W1506323687","https://openalex.org/W1573044584","https://openalex.org/W1585194019","https://openalex.org/W1594713566","https://openalex.org/W1599545538","https://openalex.org/W1711276981","https://openalex.org/W1797762004","https://openalex.org/W1982529770","https://openalex.org/W1987142766","https://openalex.org/W1998285060","https://openalex.org/W2051600983","https://openalex.org/W2055814018","https://openalex.org/W2060213695","https://openalex.org/W2066550846","https://openalex.org/W2068055184","https://openalex.org/W2076285066","https://openalex.org/W2107588378","https://openalex.org/W2121365859","https://openalex.org/W2124909257","https://openalex.org/W2132661148","https://openalex.org/W2135331739","https://openalex.org/W2139401046","https://openalex.org/W2140856295","https://openalex.org/W2153144732","https://openalex.org/W2293708017","https://openalex.org/W2487992810","https://openalex.org/W3197271110","https://openalex.org/W4232668957","https://openalex.org/W4232671690","https://openalex.org/W4241086578","https://openalex.org/W4242009960","https://openalex.org/W6634151263"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2130043461","https://openalex.org/W2530322880","https://openalex.org/W1596801655"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"an":[3,120],"inter-procedural":[4],"technique":[5],"for":[6,35,122,198,232,276,289,307],"computing":[7],"symbolic":[8,242],"bounds":[9,34,56,93,100,111,131,182,244,275,303],"on":[10,66,95,101],"the":[11,51,141,149,154],"number":[12],"of":[13,20,28,47,53,140,148,156,169,173,185,205,215,241,245,248,266,271,291,310,330,339],"statements":[14],"a":[15,62,84,170,174,190,228,246,336],"procedure":[16],"executes":[17],"in":[18,138,146,183,314],"terms":[19,139,147,184],"its":[21],"scalar":[22],"inputs":[23],"and":[24,43,75,115,255,284],"user-defined":[25,157],"quantitative":[26,158,187,230,263],"functions":[27,159,188,231],"input":[29],"data-structures.":[30],"Such":[31,300],"computational":[32,142,273],"complexity":[33,130,243,274],"even":[36,297],"simple":[37],"programs":[38],"are":[39,104,113,133,235,304,319],"usually":[40,134,236],"disjunctive,":[41],"non-linear,":[42],"involve":[44],"numerical":[45],"properties":[46],"heaps.":[48],"We":[49,117,177,202,225],"address":[50],"challenges":[52],"generating":[54],"these":[55,96,102,186,253,262,267],"using":[57,189,219],"two":[58],"novel":[59],"ideas.We":[60],"introduce":[61,153],"proof":[63,125],"methodology":[64,207],"based":[65],"multiple":[67,79,324],"counter":[68,71,97],"instrumentation":[69],"(each":[70],"can":[72,161],"be":[73,162],"initialized":[74],"incremented":[76],"at":[77],"potentially":[78],"program":[80],"locations)":[81],"that":[82,112,132,160,195,227,250,256,318],"allows":[83],"given":[85],"linear":[86,92,191],"invariant":[87,192],"generation":[88,193,240,270],"tool":[89,194],"to":[90,108,180,208,238,260,296],"compute":[91,181],"individually":[94],"variables.":[98],"The":[99],"counters":[103],"then":[105],"composed":[106],"together":[107],"generate":[109],"total":[110],"non-linear":[114],"disjunctive.":[116],"also":[118,145],"give":[119],"algorithm":[121,128],"automating":[123],"this":[124,206],"methodology.":[126],"Our":[127],"generates":[129],"precise":[135,272],"not":[136],"only":[137],"complexity,":[143],"but":[144],"constant":[150],"factors.Next,":[151],"we":[152],"notion":[155],"associated":[163],"with":[164],"abstract":[165],"data-structures,":[166,254],"e.g.,":[167],"length":[168],"list,":[171],"height":[172],"tree,":[175],"etc.":[176],"show":[178,203],"how":[179],"has":[196],"support":[197],"handling":[199],"uninterpreted":[200],"functions.":[201],"application":[204],"commonly":[209],"used":[210],"data-structures":[211],"(namely":[212],"lists,":[213,216],"list":[214],"trees,":[217],"bit-vectors)":[218],"examples":[220,278],"from":[221,280],"Microsoft":[222,281],"product":[223,282],"code.":[224],"observe":[226],"few":[229],"each":[233],"data-structure":[234],"sufficient":[237],"allow":[239],"variety":[247],"loops":[249],"iterate":[251],"over":[252],"it":[257,293],"is":[258,294],"straightforward":[259],"define":[261],"functions.The":[264],"combination":[265],"techniques":[268],"enables":[269],"real-world":[277],"(drawn":[279],"code":[283,331],"C++":[285],"STL":[286],"library":[287],"code)":[288],"some":[290],"which":[292],"non-trivial":[295],"prove":[298],"termination.":[299],"automatically":[301],"generated":[302],"very":[305],"useful":[306],"early":[308],"detection":[309],"egregious":[311],"performance":[312],"problems":[313],"large":[315],"modular":[316],"codebases":[317],"constantly":[320],"being":[321],"changed":[322],"by":[323,333],"developers":[325],"who":[326],"make":[327],"heavy":[328],"use":[329],"written":[332],"others":[334],"without":[335],"good":[337],"understanding":[338],"their":[340],"implementation":[341],"complexity.":[342]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":22},{"year":2016,"cited_by_count":18},{"year":2015,"cited_by_count":26},{"year":2014,"cited_by_count":23},{"year":2013,"cited_by_count":26},{"year":2012,"cited_by_count":26}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2016-06-24T00:00:00"}