{"id":"https://openalex.org/W4236508976","doi":"https://doi.org/10.1109/memcod.2003.1210098","title":"Methods for exploiting SAT solvers in unbounded model checking","display_name":"Methods for exploiting SAT solvers in unbounded model checking","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W4236508976","doi":"https://doi.org/10.1109/memcod.2003.1210098"},"language":"en","primary_location":{"id":"doi:10.1109/memcod.2003.1210098","doi":"https://doi.org/10.1109/memcod.2003.1210098","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2003.1210098","pdf_url":null,"source":{"id":"https://openalex.org/S7407088487","display_name":"ACM/IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"First ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2003. MEMOCODE '03. Proceedings.","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W4236508976"],"child_works_count":0,"type":"conference-paper","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/A5007261283","display_name":"K.L. McMillan","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"K.L. McMillan","raw_affiliation_strings":["Cadence Berkeley Laboratories, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cadence Berkeley Laboratories, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5007261283"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2264,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.38148609,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1254","issue":null,"first_page":"135","last_page":"142"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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.9994999766349792,"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.00019999999494757503,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.0,"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/sat-solvers","display_name":"SAT solvers","score":0.8799999952316284},{"id":"https://openalex.org/keywords/unbounded-model-checking","display_name":"unbounded model checking","score":0.996999979019165},{"id":"https://openalex.org/keywords/bounded-model-checking","display_name":"bounded model checking","score":0.9340000152587891},{"id":"https://openalex.org/keywords/counterexample-generation","display_name":"counterexample generation","score":0.8820000290870667},{"id":"https://openalex.org/keywords/temporal-characteristics","display_name":"temporal features","score":0.628000020980835},{"id":"https://openalex.org/keywords/formal-verification","display_name":"formal verification","score":0.4950000047683716}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8299211263656616},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.8184366822242737},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.765234112739563},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7191417813301086},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6835446953773499},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.643517017364502},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5287812948226929},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5144925117492676},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4749600887298584},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.42651402950286865},{"id":"https://openalex.org/C30888246","wikidata":"https://www.wikidata.org/wiki/Q4669969","display_name":"Abstraction model checking","level":3,"score":0.41131314635276794},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3646131753921509},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.31815654039382935},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2774125933647156},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2278275191783905},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/memcod.2003.1210098","doi":"https://doi.org/10.1109/memcod.2003.1210098","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2003.1210098","pdf_url":null,"source":{"id":"https://openalex.org/S7407088487","display_name":"ACM/IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"First ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2003. MEMOCODE '03. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1495266209","https://openalex.org/W1497571013","https://openalex.org/W1501649906","https://openalex.org/W1510368738","https://openalex.org/W1529461858","https://openalex.org/W1536007121","https://openalex.org/W1787074469","https://openalex.org/W1836483134","https://openalex.org/W2098244894","https://openalex.org/W2103351789","https://openalex.org/W2158395308","https://openalex.org/W4229840182","https://openalex.org/W4250884204","https://openalex.org/W4251666954","https://openalex.org/W4255982026"],"related_works":["https://openalex.org/W2166933164","https://openalex.org/W7096378935","https://openalex.org/W1836483134","https://openalex.org/W7152134482","https://openalex.org/W7097868349","https://openalex.org/W1601434878","https://openalex.org/W1578818427","https://openalex.org/W2163482209","https://openalex.org/W2484095548","https://openalex.org/W2530717459"],"abstract_inverted_index":{"Modern":[0],"SAT":[1,47,80],"solvers":[2,30],"have":[3,60],"proved":[4],"highly":[5],"successful":[6],"in":[7,86,91],"finding":[8],"counterexamples":[9],"to":[10,26,65,83,88],"temporal":[11],"properties":[12,45,90],"of":[13],"systems,":[14],"using":[15,46],"a":[16,61,79],"method":[17],"known":[18],"as":[19],"\"bounded":[20],"model":[21,67],"checking\".":[22],"It":[23],"is":[24],"natural":[25],"ask":[27],"whether":[28],"these":[29],"can":[31],"also":[32],"be":[33],"exploited":[34],"for":[35,43,50],"proving":[36,44],"correctness.":[37],"In":[38,69],"fact,":[39],"techniques":[40],"do":[41],"exist":[42],"solvers,":[48],"but":[49],"the":[51],"most":[52],"part":[53],"existing":[54],"methods":[55,76],"are":[56],"either":[57],"incomplete":[58],"or":[59],"low":[62],"capacity":[63],"relative":[64],"bounded":[66],"checking.":[68],"this":[70],"paper":[71],"we":[72],"consider":[73],"two":[74],"new":[75],"that":[77],"exploit":[78],"solver's":[81],"ability":[82],"generate":[84],"refutations":[85],"order":[87],"prove":[89],"an":[92],"unbounded":[93],"sense.":[94]},"counts_by_year":[],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2022-05-12T00:00:00"}