{"id":"https://openalex.org/W1992562623","doi":"https://doi.org/10.1109/memcod.2006.1695908","title":"Scalable program analysis using Boolean satisfiability","display_name":"Scalable program analysis using Boolean satisfiability","publication_year":2006,"publication_date":"2006-09-22","ids":{"openalex":"https://openalex.org/W1992562623","doi":"https://doi.org/10.1109/memcod.2006.1695908","mag":"1992562623"},"language":"en","primary_location":{"id":"doi:10.1109/memcod.2006.1695908","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2006.1695908","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fourth ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2006. MEMOCODE '06. Proceedings.","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/A5087402475","display_name":"Alex Aiken","orcid":"https://orcid.org/0000-0002-3723-9555"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]},{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"A. Aiken","raw_affiliation_strings":["EECS Department, University of California Berkeley, Berkeley, USA","IBM Almaden Research Center, USA"],"affiliations":[{"raw_affiliation_string":"EECS Department, University of California Berkeley, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"IBM Almaden Research Center, USA","institution_ids":["https://openalex.org/I4210085935"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5087402475"],"corresponding_institution_ids":["https://openalex.org/I4210085935","https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.077746,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"89","last_page":"90"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9923999905586243,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9923999905586243,"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.9922000169754028,"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.9883999824523926,"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/scalability","display_name":"Scalability","score":0.8154642581939697},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7719724178314209},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.7554668188095093},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7488236427307129},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.585858941078186},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.533478856086731},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5072140693664551},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.48803797364234924},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.41057509183883667},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33907365798950195},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2611358165740967}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.8154642581939697},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7719724178314209},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.7554668188095093},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7488236427307129},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.585858941078186},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.533478856086731},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5072140693664551},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.48803797364234924},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.41057509183883667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33907365798950195},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2611358165740967},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/memcod.2006.1695908","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2006.1695908","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fourth ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2006. MEMOCODE '06. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals","score":0.49000000953674316}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2408080066","https://openalex.org/W2394616262","https://openalex.org/W192406999","https://openalex.org/W2406837904","https://openalex.org/W3152212242","https://openalex.org/W2332241156","https://openalex.org/W4240446120","https://openalex.org/W3173322326","https://openalex.org/W2014111643","https://openalex.org/W3120153087"],"abstract_inverted_index":{"Summary":[0],"form":[1],"only":[2],"given.":[3],"Static":[4],"program":[5],"analysis":[6],"suffers":[7],"from":[8],"a":[9],"fundamental":[10],"trade-off":[11],"between":[12],"precision":[13],"and":[14,16,63],"scalability,":[15],"the":[17,22,28],"analyses":[18,57],"that":[19,58],"scale":[20],"to":[21,51],"largest":[23],"programs":[24],"are":[25,59],"generally":[26],"not":[27],"most":[29],"precise":[30,62],"methods":[31],"known.":[32],"This":[33],"talk":[34],"describes":[35],"how":[36,72],"recent":[37],"advances":[38],"in":[39,56,79],"algorithms":[40],"for":[41],"solving":[42],"instances":[43],"of":[44,81,83],"Boolean":[45],"satisfiability":[46],"(SAT)":[47],"can":[48],"be":[49,77],"exploited":[50],"relax":[52],"this":[53],"trade-off,":[54],"resulting":[55],"both":[60],"more":[61,64],"scalable":[65],"than":[66],"existing":[67],"techniques,":[68],"as":[69,71],"well":[70],"these":[73],"improved":[74],"capabilities":[75],"might":[76],"used":[78],"verification":[80],"properties":[82],"large":[84],"systems":[85]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}