{"id":"https://openalex.org/W2037395516","doi":"https://doi.org/10.1016/j.entcs.2004.06.062","title":"An Incremental Algorithm to Check Satisfiability for Bounded Model Checking","display_name":"An Incremental Algorithm to Check Satisfiability for Bounded Model Checking","publication_year":2005,"publication_date":"2005-03-01","ids":{"openalex":"https://openalex.org/W2037395516","doi":"https://doi.org/10.1016/j.entcs.2004.06.062","mag":"2037395516"},"language":"en","primary_location":{"id":"doi:10.1016/j.entcs.2004.06.062","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2004.06.062","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/j.entcs.2004.06.062","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109876907","display_name":"HoonSang Jin","orcid":null},"institutions":[{"id":"https://openalex.org/I2802236040","display_name":"University of Colorado System","ror":"https://ror.org/00jc20583","country_code":"US","type":"education","lineage":["https://openalex.org/I2802236040"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"HoonSang Jin","raw_affiliation_strings":["University of Colorado at Boulder"],"affiliations":[{"raw_affiliation_string":"University of Colorado at Boulder","institution_ids":["https://openalex.org/I2802236040"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077549627","display_name":"Fabio Somenzi","orcid":"https://orcid.org/0000-0002-2085-2003"},"institutions":[{"id":"https://openalex.org/I2802236040","display_name":"University of Colorado System","ror":"https://ror.org/00jc20583","country_code":"US","type":"education","lineage":["https://openalex.org/I2802236040"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Fabio Somenzi","raw_affiliation_strings":["University of Colorado at Boulder"],"affiliations":[{"raw_affiliation_string":"University of Colorado at Boulder","institution_ids":["https://openalex.org/I2802236040"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077549627","https://openalex.org/A5109876907"],"corresponding_institution_ids":["https://openalex.org/I2802236040"],"apc_list":null,"apc_paid":null,"fwci":4.3762,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.94792667,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"119","issue":"2","first_page":"51","last_page":"65"},"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.9941999912261963,"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.989300012588501,"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/counterexample","display_name":"Counterexample","score":0.8223729729652405},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.7674133777618408},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7479948997497559},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6450421810150146},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6219620704650879},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6092705726623535},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.48405900597572327},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.4831249415874481},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47251424193382263},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.44314947724342346},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43299174308776855},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.31948456168174744},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28588804602622986},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2788664698600769}],"concepts":[{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.8223729729652405},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.7674133777618408},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7479948997497559},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6450421810150146},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6219620704650879},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6092705726623535},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.48405900597572327},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.4831249415874481},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47251424193382263},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.44314947724342346},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43299174308776855},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31948456168174744},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28588804602622986},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2788664698600769},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","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/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/j.entcs.2004.06.062","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2004.06.062","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.87.3970","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.3970","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://bmc04.inf.ethz.ch/JinSomenzi-BMC04-preliminary.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1016/j.entcs.2004.06.062","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2004.06.062","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W79534266","https://openalex.org/W1495266209","https://openalex.org/W1510368738","https://openalex.org/W1511155470","https://openalex.org/W1535375892","https://openalex.org/W1588880699","https://openalex.org/W1597578789","https://openalex.org/W1608279203","https://openalex.org/W1787074469","https://openalex.org/W1822320350","https://openalex.org/W2046239089","https://openalex.org/W2048051309","https://openalex.org/W2057361103","https://openalex.org/W2062897452","https://openalex.org/W2075959177","https://openalex.org/W2080267935","https://openalex.org/W2090398333","https://openalex.org/W2096307462","https://openalex.org/W2107470986","https://openalex.org/W2110123236","https://openalex.org/W2110737535","https://openalex.org/W2142306100","https://openalex.org/W2146662253","https://openalex.org/W2152426072","https://openalex.org/W2169373662","https://openalex.org/W2486322305","https://openalex.org/W2497034652","https://openalex.org/W4229840182","https://openalex.org/W4247585869","https://openalex.org/W6629648295","https://openalex.org/W6630511988","https://openalex.org/W6635991431","https://openalex.org/W6638722481","https://openalex.org/W6676112844"],"related_works":["https://openalex.org/W2349952486","https://openalex.org/W1489260687","https://openalex.org/W2953113086","https://openalex.org/W1552191998","https://openalex.org/W2056825861","https://openalex.org/W2765989158","https://openalex.org/W2952737788","https://openalex.org/W4226455345","https://openalex.org/W2912813468","https://openalex.org/W4281812495"],"abstract_inverted_index":{"In":[0,80,103,318],"Bounded":[1,171],"Model":[2,172],"Checking":[3],"(BMC),":[4],"the":[5,28,45,65,69,81,97,133,136,185,218,250,259,278,303,311,314,323,326,334,340,347,352,355],"search":[6,341],"for":[7,96,142,249,310,359],"counterexamples":[8],"of":[9,17,30,71,83,135,202,220,252,302,313,316,325,336,339,354],"increasing":[10],"lengths":[11],"is":[12,22,241,282],"translated":[13],"into":[14,57,187],"a":[15,84,221,266,283],"sequence":[16,70,315],"satisfiability":[18],"(SAT)":[19],"checks.":[20],"It":[21],"natural":[23],"to":[24,26,44,50,64,214,225,234,268,271,292,332],"try":[25],"exploit":[27],"similarity":[29],"these":[31],"SAT":[32,72,127,157,188,260,349],"instances":[33,73],"by":[34,90,155],"forwarding":[35],"clauses":[36,52,123,180,194,228,270,298],"learned":[37,124,179],"during":[38,125],"conflict":[39,227],"analysis":[40],"from":[41],"one":[42,126],"instance":[43],"next.":[46],"The":[47],"methods":[48],"proposed":[49,356],"identify":[51],"that":[53,61,67,76,121,129,177,195,229,286,299,328],"remain":[54,138,308],"valid":[55,139,309],"fall":[56],"two":[58],"categories:":[59],"Those":[60],"are":[62,196,201,300],"oblivious":[63],"mechanism":[66],"generates":[68],"and":[74,107,146,150,205,244,255,295,306],"those":[75,122],"rely":[77],"on":[78,132,170],"it.":[79],"case":[82],"BMC":[85],"run,":[86],"it":[87],"was":[88],"observed":[89],"Strichman":[91],"[O.":[92],"Shtrichman.":[93],"Pruning":[94],"techniques":[95],"SAT-based":[98],"bounded":[99],"model":[100,137],"checking":[101,141],"problem.":[102],"Correct":[104],"Hardware":[105],"Design":[106],"Verification":[108],"Methods":[109],"(CHARME":[110],"2001),":[111],"pages":[112],"58\u201370,":[113],"Livingston,":[114],"Scotland,":[115],"Sept.":[116],"2001.":[117],"Springer.":[118],"LNCS":[119],"2144]":[120],"check":[128],"only":[130],"depend":[131],"structure":[134],"when":[140],"longer":[143],"counterexamples.":[144],"E\u00e9n":[145,149],"S\u00f6rensson":[147],"[N.":[148],"N.":[151],"S\u00f6rensson.":[152],"Temporal":[153],"induction":[154],"incremental":[156,293],"solving.":[158],"Electronic":[159],"Notes":[160],"in":[161,217,239,258,290],"Theoretical":[162],"Computer":[163],"Science,":[164],"89(4),":[165],"2003.":[166],"First":[167],"International":[168],"Workshop":[169],"Checking.":[173],"http://www.elsevier.nl/locate/entcs/]":[174],"pointed":[175],"out":[176],"all":[178],"can":[181,230,287],"be":[182,231,272,288],"forwarded":[183,197,233,273],"if":[184],"translation":[186],"obeys":[189],"commonly":[190],"followed":[191],"rules.":[192],"Many":[193],"this":[198],"way,":[199],"however,":[200],"little":[203],"usefulness":[204],"may":[206],"degrade":[207],"performance.":[208],"This":[209,237,262],"paper":[210,263],"presents":[211],"an":[212],"extension":[213],"Strichman's":[215],"approach":[216,285],"form":[219],"more":[222],"general":[223,291],"criterion":[224],"filter":[226],"profitably":[232],"successive":[235],"instances.":[236,317],"criterion,":[238],"particular,":[240],"still":[242],"syntactic":[243,279],"quite":[245],"efficient,":[246],"but":[247],"accounts":[248],"presence":[251],"both":[253],"primary":[254,304],"auxiliary":[256],"objectives":[257],"instance.":[261],"also":[264],"introduces":[265],"technique":[267],"distill":[269],"even":[274],"though":[275],"they":[276],"fail":[277],"check.":[280],"Distillation":[281],"semantic":[284],"applied":[289],"SAT,":[294],"often":[296,321],"produces":[297],"independent":[301],"objective,":[305],"hence":[307],"remainder":[312],"addition,":[319],"distillation":[320],"improves":[322],"quality":[324],"clauses,":[327],"is,":[329],"their":[330],"ability":[331],"prevent":[333],"examination":[335],"large":[337],"regions":[338],"space.":[342],"Experimental":[343],"results":[344],"obtained":[345],"with":[346],"CirCUs":[348],"solver":[350],"confirm":[351],"efficacy":[353],"techniques,":[357],"especially":[358],"large,":[360],"hard":[361],"problems.":[362]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}