{"id":"https://openalex.org/W2140809377","doi":"https://doi.org/10.1145/1375581.1375615","title":"Sound, complete and scalable path-sensitive analysis","display_name":"Sound, complete and scalable path-sensitive analysis","publication_year":2008,"publication_date":"2008-06-07","ids":{"openalex":"https://openalex.org/W2140809377","doi":"https://doi.org/10.1145/1375581.1375615","mag":"2140809377"},"language":"en","primary_location":{"id":"doi:10.1145/1375581.1375615","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1375581.1375615","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation","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/A5006424908","display_name":"I\u015f\u0131l Dillig","orcid":"https://orcid.org/0000-0001-8006-1230"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Isil Dillig","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074844638","display_name":"Thomas Dillig","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas Dillig","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087402475","display_name":"Alex Aiken","orcid":"https://orcid.org/0000-0002-3723-9555"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alex Aiken","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5006424908"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":13.5825,"has_fulltext":false,"cited_by_count":124,"citation_normalized_percentile":{"value":0.99113134,"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":"270","last_page":"280"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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.9997000098228455,"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.9991000294685364,"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/unobservable","display_name":"Unobservable","score":0.9530842900276184},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7312619686126709},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6244632601737976},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6105861067771912},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6072326898574829},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5772128701210022},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5624381899833679},{"id":"https://openalex.org/keywords/observable","display_name":"Observable","score":0.53947514295578},{"id":"https://openalex.org/keywords/kernel","display_name":"Kernel (algebra)","score":0.5376931428909302},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5115509629249573},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.5113987326622009},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4931640028953552},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4392460286617279},{"id":"https://openalex.org/keywords/computability","display_name":"Computability","score":0.42037534713745117},{"id":"https://openalex.org/keywords/scope","display_name":"Scope (computer science)","score":0.41517993807792664},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2530181407928467},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20604625344276428},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1762436330318451},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.08612316846847534}],"concepts":[{"id":"https://openalex.org/C2780695315","wikidata":"https://www.wikidata.org/wiki/Q3799040","display_name":"Unobservable","level":2,"score":0.9530842900276184},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7312619686126709},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6244632601737976},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6105861067771912},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6072326898574829},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5772128701210022},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5624381899833679},{"id":"https://openalex.org/C32848918","wikidata":"https://www.wikidata.org/wiki/Q845789","display_name":"Observable","level":2,"score":0.53947514295578},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.5376931428909302},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5115509629249573},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.5113987326622009},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4931640028953552},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4392460286617279},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.42037534713745117},{"id":"https://openalex.org/C2778012447","wikidata":"https://www.wikidata.org/wiki/Q1034415","display_name":"Scope (computer science)","level":2,"score":0.41517993807792664},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2530181407928467},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20604625344276428},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1762436330318451},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.08612316846847534},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C149782125","wikidata":"https://www.wikidata.org/wiki/Q160039","display_name":"Econometrics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1375581.1375615","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1375581.1375615","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.142.3447","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.3447","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.stanford.edu/~aiken/publications/papers/pldi08.pdf","raw_type":"text"},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:1401458","is_oa":false,"landing_page_url":"http://discovery.ucl.ac.uk/1401458/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"     In:    (pp. pp. 270-280).   (2008)     ","raw_type":"Proceedings paper"},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:1404677","is_oa":false,"landing_page_url":"http://discovery.ucl.ac.uk/1404677/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"   ACM SIGPLAN Notices , 43  (6)   pp. 270-280.   (2008)      ","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.550000011920929,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W7357918","https://openalex.org/W148396834","https://openalex.org/W1514446453","https://openalex.org/W1533964197","https://openalex.org/W1560527899","https://openalex.org/W1578044518","https://openalex.org/W1598913101","https://openalex.org/W1691700263","https://openalex.org/W1966982815","https://openalex.org/W2025057593","https://openalex.org/W2052286082","https://openalex.org/W2052664195","https://openalex.org/W2061438988","https://openalex.org/W2080573945","https://openalex.org/W2089139117","https://openalex.org/W2103714221","https://openalex.org/W2122464905","https://openalex.org/W2135794045","https://openalex.org/W2138378640","https://openalex.org/W2139668965","https://openalex.org/W2151463894","https://openalex.org/W2154632906","https://openalex.org/W2175655382","https://openalex.org/W3000428991","https://openalex.org/W3115527712","https://openalex.org/W4212792638","https://openalex.org/W4230796557","https://openalex.org/W6634586062"],"related_works":["https://openalex.org/W2008534419","https://openalex.org/W993532209","https://openalex.org/W2741602769","https://openalex.org/W2079877197","https://openalex.org/W1578306890","https://openalex.org/W57996428","https://openalex.org/W4384915695","https://openalex.org/W2065742713","https://openalex.org/W2886431776","https://openalex.org/W2883500998"],"abstract_inverted_index":{"We":[0,87],"present":[1],"a":[2,37,72,121],"new,":[3],"precise":[4,93],"technique":[5,14,76,113],"for":[6,27,98],"fully":[7],"path-":[8,23],"and":[9,24,49,101],"context-sensitive":[10,25],"program":[11,29,122],"analysis.":[12],"Our":[13],"exploits":[15],"two":[16],"observations:":[17],"First,":[18],"using":[19],"quantified,":[20],"recursive":[21,43,85],"formulas,":[22],"conditions":[26],"many":[28],"properties":[30],"can":[31,68],"be":[32,69],"expressed":[33],"exactly.":[34],"To":[35],"compute":[36],"closed":[38],"form":[39],"solution":[40,90],"to":[41,82,114,116],"such":[42],"constraints,":[44],"we":[45],"differentiate":[46],"between":[47],"observable":[48],"unobservable":[50,66],"variables,":[51],"the":[52,63,83,89,95,117],"latter":[53],"of":[54,128],"which":[55],"are":[56],"existentially":[57],"quantified":[58],"in":[59,109],"our":[60,75,112],"approach.":[61],"Using":[62],"insight":[64],"that":[65],"variables":[67],"eliminated":[70],"outside":[71],"certain":[73],"scope,":[74],"computes":[77],"satisfiability-and":[78],"validity-preserving":[79],"closed-form":[80],"solutions":[81],"original":[84,96],"constraints.":[86],"prove":[88],"is":[91],"as":[92,94,104,106],"system":[97],"answering":[99],"may":[100],"must":[102],"queries":[103],"well":[105],"being":[107],"small":[108],"practice,":[110],"allowing":[111],"scale":[115],"entire":[118],"Linux":[119],"kernel,":[120],"with":[123],"over":[124],"6":[125],"million":[126],"lines":[127],"code.":[129],"Copyright":[130],"\u00a9":[131],"2008":[132],"ACM.":[133]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":16}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}