{"id":"https://openalex.org/W4237087841","doi":"https://doi.org/10.1145/543552.512538","title":"ESP: path-sensitive program verification in polynomial time","display_name":"ESP: path-sensitive program verification in polynomial time","alternate_titles":[],"publication_year":2002,"publication_date":"2002-05-17","ids":{"openalex":"https://openalex.org/W4237087841","doi":"https://doi.org/10.1145/543552.512538"},"language":"en","primary_location":{"id":"doi:10.1145/543552.512538","doi":"https://doi.org/10.1145/543552.512538","is_oa":false,"landing_page_url":"https://doi.org/10.1145/543552.512538","pdf_url":null,"source":{"id":"https://openalex.org/S148324379","display_name":"ACM SIGPLAN Notices","issn_l":"0362-1340","issn":["0362-1340","1558-1160"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGPLAN Notices","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W4237087841"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5028871445","display_name":"Manuvir Das","orcid":null,"observed_orcids":[]},"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":"Manuvir Das","raw_affiliation_strings":["Microsoft Research"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043665959","display_name":"Sorin Lerner","orcid":"https://orcid.org/0000-0003-3957-0628","observed_orcids":["https://orcid.org/0000-0003-3957-0628"]},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sorin Lerner","raw_affiliation_strings":["University of Washington"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Washington","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028310107","display_name":"Mark Seigle","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mark Seigle","raw_affiliation_strings":["University of Washington"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Washington","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5704,"has_fulltext":false,"cited_by_count":76,"citation_normalized_percentile":{"value":0.89544311,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":98},"biblio":{"volume":"37","issue":"5","first_page":"57","last_page":"68"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.8481000065803528,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.8481000065803528,"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/T10142","display_name":"Formal Methods in Verification","score":0.0828000009059906,"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.06279999762773514,"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/polynomial-time-verification","display_name":"polynomial-time verification","score":0.6050000190734863},{"id":"https://openalex.org/keywords/temporal-safety-properties","display_name":"temporal safety properties","score":0.8790000081062317},{"id":"https://openalex.org/keywords/branch-pruning","display_name":"branch pruning","score":0.4449999928474426},{"id":"https://openalex.org/keywords/gnu-c-compiler","display_name":"GNU C compiler","score":0.8949999809265137}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9010211229324341},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.7567299604415894},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6381328105926514},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4949027895927429},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.48137572407722473},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4278143048286438},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42703455686569214},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32287073135375977},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07423442602157593},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/543552.512538","doi":"https://doi.org/10.1145/543552.512538","is_oa":false,"landing_page_url":"https://doi.org/10.1145/543552.512538","pdf_url":null,"source":{"id":"https://openalex.org/S148324379","display_name":"ACM SIGPLAN Notices","issn_l":"0362-1340","issn":["0362-1340","1558-1160"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGPLAN Notices","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.205.3511","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.205.3511","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.ucsd.edu/groups/progsys/pubs/esp_pldi_02.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.73.4623","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.4623","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://pag.lcs.mit.edu/reading-group/esp-pldi02.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1588878641","https://openalex.org/W1604147565","https://openalex.org/W1734116059","https://openalex.org/W1993836075","https://openalex.org/W1998070736","https://openalex.org/W2007181618","https://openalex.org/W2036918610","https://openalex.org/W2043100293","https://openalex.org/W2043811931","https://openalex.org/W2044590882","https://openalex.org/W2059590831","https://openalex.org/W2066859698","https://openalex.org/W2080573945","https://openalex.org/W2084974764","https://openalex.org/W2089294198","https://openalex.org/W2095115578","https://openalex.org/W2106972913","https://openalex.org/W2156268601","https://openalex.org/W2164778826","https://openalex.org/W2295399529","https://openalex.org/W2295622790","https://openalex.org/W2914074464","https://openalex.org/W2952445416","https://openalex.org/W2987907651"],"related_works":["https://openalex.org/W7099081991","https://openalex.org/W7095568612","https://openalex.org/W1824118603","https://openalex.org/W48672996","https://openalex.org/W2786344151","https://openalex.org/W2150885642","https://openalex.org/W2060393677","https://openalex.org/W4210757462"],"abstract_inverted_index":{"In":[0],"this":[1,89],"paper,":[2],"we":[3,58],"present":[4,103],"a":[5,25,28,44,96,119],"new":[6],"algorithm":[7,62,92],"for":[8,46],"partial":[9,97],"program":[10,26,45,70],"verification":[11,98],"that":[12,24,36,63,134,159],"runs":[13],"in":[14,22,43,142],"polynomial":[15],"time":[16],"and":[17,166],"space.":[18],"We":[19,102,129],"are":[20,130,148],"interested":[21],"checking":[23],"satisfies":[27],"given":[29,75],"temporal":[30],"safety":[31],"property.":[32],"Our":[33,156],"insight":[34],"is":[35,64,167],"by":[37],"accurately":[38],"modeling":[39],"only":[40],"those":[41],"branches":[42],"which":[47],"the":[48,53,56,69,74,79,104,110,114,122,137,143],"property-related":[49],"behavior":[50,117],"differs":[51],"along":[52],"arms":[54],"of":[55,83,95,106,112,118,121,136,146],"branch,":[57],"can":[59],"design":[60],"an":[61],"accurate":[65,168],"enough":[66,169],"to":[67,73,109,132,140,150,152,163,170],"verify":[68,171],"with":[71],"respect":[72],"property,":[76],"without":[77],"paying":[78],"potentially":[80],"exponential":[81],"cost":[82],"full":[84],"path-sensitive":[85],"analysis.We":[86],"have":[87],"implemented":[88],"\"property":[90],"simulation\"":[91],"as":[93],"part":[94],"tool":[99],"called":[100],"ESP.":[101],"results":[105,157],"applying":[107],"ESP":[108],"problem":[111],"verifying":[113],"file":[115],"I/O":[116],"version":[120],"GNU":[123],"C":[124],"compiler":[125],"(gcc,":[126],"140,000":[127],"LOC).":[128],"able":[131],"prove":[133],"all":[135],"646":[138],"calls":[139],".fprintf":[141],"source":[144],"code":[145],"gcc":[147],"guaranteed":[149],"print":[151],"valid,":[153],"open":[154],"files.":[155],"show":[158],"property":[160],"simulation":[161],"scales":[162],"large":[164],"programs":[165],"meaningful":[172],"properties.":[173]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4237087841","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":7}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2022-05-12T00:00:00"}
