{"id":"https://openalex.org/W1966982815","doi":"https://doi.org/10.1145/1040305.1040334","title":"Scalable error detection using boolean satisfiability","display_name":"Scalable error detection using boolean satisfiability","publication_year":2005,"publication_date":"2005-01-12","ids":{"openalex":"https://openalex.org/W1966982815","doi":"https://doi.org/10.1145/1040305.1040334","mag":"1966982815"},"language":"en","primary_location":{"id":"doi:10.1145/1040305.1040334","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1040305.1040334","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd 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/A5046598816","display_name":"Yichen Xie","orcid":"https://orcid.org/0000-0002-0974-5979"},"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":"Yichen Xie","raw_affiliation_strings":["University of Stanford, Stanford, CA","Univ. of Stanford, Stanford, CA#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Stanford, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Univ. of Stanford, Stanford, CA#TAB#","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":["University of Stanford, Stanford, CA","Univ. of Stanford, Stanford, CA#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Stanford, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Univ. of Stanford, Stanford, CA#TAB#","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046598816"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":28.9492,"has_fulltext":false,"cited_by_count":212,"citation_normalized_percentile":{"value":0.99875192,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"351","last_page":"363"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9995999932289124,"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9986000061035156,"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.8090894222259521},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.7204917669296265},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5170824527740479},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5031852126121521},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.48165667057037354},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.476335346698761},{"id":"https://openalex.org/keywords/abstract-interpretation","display_name":"Abstract interpretation","score":0.4695824980735779},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46451014280319214},{"id":"https://openalex.org/keywords/and-inverter-graph","display_name":"And-inverter graph","score":0.46326640248298645},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4536804258823395},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.4316244423389435},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.3400914967060089},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.29638850688934326},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.10377070307731628}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8090894222259521},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.7204917669296265},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5170824527740479},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5031852126121521},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48165667057037354},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.476335346698761},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.4695824980735779},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46451014280319214},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.46326640248298645},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4536804258823395},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.4316244423389435},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.3400914967060089},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.29638850688934326},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.10377070307731628}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1040305.1040334","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1040305.1040334","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.188.9768","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.9768","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://pag.csail.mit.edu/reading-group/xie05satisfiability.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.584.120","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.584.120","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.stanford.edu/class/cs295/papers/p351-xie.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.92.441","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.92.441","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/popl05.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6499999761581421,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W19219339","https://openalex.org/W1491178396","https://openalex.org/W1520671672","https://openalex.org/W1596552075","https://openalex.org/W1720848645","https://openalex.org/W1968898611","https://openalex.org/W2066859698","https://openalex.org/W2074845051","https://openalex.org/W2080267935","https://openalex.org/W2084974764","https://openalex.org/W2089139117","https://openalex.org/W2096307462","https://openalex.org/W2103714221","https://openalex.org/W2105357036","https://openalex.org/W2106972913","https://openalex.org/W2107089133","https://openalex.org/W2112243500","https://openalex.org/W2129538349","https://openalex.org/W2142785340","https://openalex.org/W2156268601","https://openalex.org/W2164392635","https://openalex.org/W2171733626","https://openalex.org/W2171999426","https://openalex.org/W2295903414","https://openalex.org/W4214630400","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2525463489","https://openalex.org/W2157660637","https://openalex.org/W2077499329","https://openalex.org/W2970480852","https://openalex.org/W1836373119","https://openalex.org/W1745650241","https://openalex.org/W2148332793","https://openalex.org/W2184010066","https://openalex.org/W4389779327","https://openalex.org/W3095638317"],"abstract_inverted_index":{"We":[0],"describe":[1],"a":[2,70,89,110,145],"software":[3],"error-detection":[4],"tool":[5],"that":[6,58],"exploits":[7],"recent":[8],"advances":[9],"in":[10,74,92,128],"boolean":[11,56,97],"satisfiability":[12],"(SAT)":[13],"solvers.":[14],"Our":[15,32],"analysis":[16,87,120],"is":[17,34],"path":[18],"sensitive,":[19],"precise":[20],"down":[21],"to":[22,99],"the":[23,52,55,60,65,75,93,96,103,129,133],"bit":[24],"level,":[25],"and":[26,29,62,64,114],"models":[27],"pointers":[28],"heap":[30,66],"data.":[31],"approach":[33,107],"also":[35],"highly":[36],"scalable,":[37],"which":[38,139],"we":[39],"achieve":[40],"using":[41],"two":[42],"techniques.":[43],"First,":[44],"for":[45,82],"each":[46,83],"program":[47],"function,":[48,84],"several":[49],"optimizations":[50],"compress":[51],"size":[53,94],"of":[54,77,95,105,121,138,149],"formulas":[57],"model":[59],"control-":[61],"data-flow":[63],"locations":[67],"accessed":[68],"by":[69,108],"function.":[71],"Second,":[72],"summaries":[73],"spirit":[76],"type":[78],"signatures":[79],"are":[80],"computed":[81],"allowing":[85],"inter-procedural":[86],"without":[88],"dramatic":[90],"increase":[91],"constraints":[98],"be":[100],"solved.We":[101],"demonstrate":[102],"effectiveness":[104],"our":[106],"constructing":[109],"lock":[111,125],"interface":[112],"inference":[113],"checking":[115],"tool.":[116],"In":[117],"an":[118],"interprocedural":[119],"more":[122],"than":[123],"23,000":[124],"related":[126],"functions":[127],"latest":[130],"Linux":[131],"kernel,":[132],"checker":[134],"generated":[135],"300":[136],"warnings,":[137],"179":[140],"were":[141],"unique":[142],"locking":[143],"errors,":[144],"false":[146],"positive":[147],"rate":[148],"only":[150],"40%.":[151]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":11}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}