{"id":"https://openalex.org/W2594912772","doi":null,"title":"Exploring Constraint Satisfiability Techniques in Formal Verification","display_name":"Exploring Constraint Satisfiability Techniques in Formal Verification","publication_year":2008,"publication_date":"2008-05-06","ids":{"openalex":"https://openalex.org/W2594912772","mag":"2594912772"},"language":"en","primary_location":{"id":"pmh:oai:vtechworks.lib.vt.edu:10919/27573","doi":null,"is_oa":true,"landing_page_url":"http://scholar.lib.vt.edu/theses/available/etd-05072008-220806/","pdf_url":"http://hdl.handle.net/10919/27573","source":{"id":"https://openalex.org/S4306400248","display_name":"VTechWorks (Virginia Tech)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I859038795","host_organization_name":"Virginia Tech","host_organization_lineage":["https://openalex.org/I859038795"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Dissertation"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/10919/27573","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Lei Fang","orcid":"https://orcid.org/0000-0001-9028-8797","observed_orcids":["https://orcid.org/0000-0001-9028-8797"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Lei Fang","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-9028-8797","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.8314999938011169,"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.8314999938011169,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.15719999372959137,"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"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.0020000000949949026,"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/propositional-satisfiability","display_name":"propositional satisfiability","score":0.9559999704360962},{"id":"https://openalex.org/keywords/hybrid-search","display_name":"hybrid retrieval","score":0.5090000033378601},{"id":"https://openalex.org/keywords/conflict-driven-clause-learning","display_name":"conflict-driven clause learning","score":0.7350000143051147},{"id":"https://openalex.org/keywords/pseudo-boolean-constraints","display_name":"pseudo-Boolean constraints","score":0.7960000038146973},{"id":"https://openalex.org/keywords/memory-usage","display_name":"memory usage","score":0.746999979019165},{"id":"https://openalex.org/keywords/maxsat","display_name":"MaxSAT","score":0.7710000276565552},{"id":"https://openalex.org/keywords/formal-verification","display_name":"formal verification","score":0.7950000166893005},{"id":"https://openalex.org/keywords/electronic-design-automation","display_name":"electronic design automation","score":0.781000018119812},{"id":"https://openalex.org/keywords/boolean-constraint-propagation","display_name":"Boolean constraint propagation","score":0.5370000004768372}],"concepts":[{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.7566184997558594},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7454600930213928},{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.7190444469451904},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6041346192359924},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5235124230384827},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.5227813124656677},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5219942331314087},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5020873546600342},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4681779444217682},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4447404742240906},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2821469306945801},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18902575969696045},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16639533638954163},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:vtechworks.lib.vt.edu:10919/27573","doi":null,"is_oa":true,"landing_page_url":"http://scholar.lib.vt.edu/theses/available/etd-05072008-220806/","pdf_url":"http://hdl.handle.net/10919/27573","source":{"id":"https://openalex.org/S4306400248","display_name":"VTechWorks (Virginia Tech)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I859038795","host_organization_name":"Virginia Tech","host_organization_lineage":["https://openalex.org/I859038795"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Dissertation"},{"id":"mag:2594912772","doi":null,"is_oa":false,"landing_page_url":"https://scholar.lib.vt.edu/theses/available/etd-05072008-220806/unrestricted/Dissertation_Final_Lei.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:vtechworks.lib.vt.edu:10919/27573","doi":null,"is_oa":true,"landing_page_url":"http://scholar.lib.vt.edu/theses/available/etd-05072008-220806/","pdf_url":"http://hdl.handle.net/10919/27573","source":{"id":"https://openalex.org/S4306400248","display_name":"VTechWorks (Virginia Tech)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I859038795","host_organization_name":"Virginia Tech","host_organization_lineage":["https://openalex.org/I859038795"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Dissertation"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2594912772.pdf","grobid_xml":"https://content.openalex.org/works/W2594912772.grobid-xml"},"referenced_works_count":69,"referenced_works":["https://openalex.org/W28035284","https://openalex.org/W81610693","https://openalex.org/W99286309","https://openalex.org/W142625004","https://openalex.org/W569349792","https://openalex.org/W1484851744","https://openalex.org/W1494481937","https://openalex.org/W1495266209","https://openalex.org/W1495369628","https://openalex.org/W1501731334","https://openalex.org/W1510368738","https://openalex.org/W1512232178","https://openalex.org/W1516430219","https://openalex.org/W1517759292","https://openalex.org/W1518705996","https://openalex.org/W1520090510","https://openalex.org/W1531103278","https://openalex.org/W1569133313","https://openalex.org/W1581661059","https://openalex.org/W1593428110","https://openalex.org/W1594093112","https://openalex.org/W1602917641","https://openalex.org/W1667614912","https://openalex.org/W1728966390","https://openalex.org/W1776207179","https://openalex.org/W1819209966","https://openalex.org/W1836625149","https://openalex.org/W1837817108","https://openalex.org/W1951141208","https://openalex.org/W1967553065","https://openalex.org/W1985602827","https://openalex.org/W2005573219","https://openalex.org/W2010300986","https://openalex.org/W2028329758","https://openalex.org/W2029688740","https://openalex.org/W2035199637","https://openalex.org/W2044560939","https://openalex.org/W2057361103","https://openalex.org/W2062897452","https://openalex.org/W2074078071","https://openalex.org/W2080267935","https://openalex.org/W2096076317","https://openalex.org/W2096307462","https://openalex.org/W2107470986","https://openalex.org/W2108637261","https://openalex.org/W2110123236","https://openalex.org/W2111265695","https://openalex.org/W2116758077","https://openalex.org/W2121957284","https://openalex.org/W2123843480","https://openalex.org/W2125047455","https://openalex.org/W2131367934","https://openalex.org/W2137331557","https://openalex.org/W2139171217","https://openalex.org/W2142785340","https://openalex.org/W2144883917","https://openalex.org/W2149968564","https://openalex.org/W2150119568","https://openalex.org/W2151398141","https://openalex.org/W2152077779","https://openalex.org/W2153935965","https://openalex.org/W2154352023","https://openalex.org/W2156490005","https://openalex.org/W2159503942","https://openalex.org/W2164374928","https://openalex.org/W2165372647","https://openalex.org/W2171471221","https://openalex.org/W2340735175","https://openalex.org/W2971807880"],"related_works":["https://openalex.org/W4298776652","https://openalex.org/W2131367934","https://openalex.org/W7100549314","https://openalex.org/W4251625379","https://openalex.org/W7095345258","https://openalex.org/W3129410028","https://openalex.org/W2560525892","https://openalex.org/W2047512375","https://openalex.org/W7099046231","https://openalex.org/W1531403982"],"abstract_inverted_index":{"Due":[0],"to":[1,20,34,48,105,113,128,148,193,247,283,331,340,362,379,390],"the":[2,22,25,36,82,85,106,118,129,157,162,176,189,195,202,222,241,268,272,299,328,333,342,345,386,398],"widespread":[3],"demands":[4],"for":[5,235,243,252,318],"efficient":[6],"Propositional":[7],"Satisfiability":[8],"(SAT)":[9],"solvers":[10,230],"and":[11,40,67,135,183,210,277],"its":[12],"derivatives":[13],"in":[14,59,84,93,132,181,434],"Electronic":[15],"Design":[16],"Automation":[17],"applications,":[18],"methods":[19],"boost":[21,49],"performance":[23,37,52,182,209],"of":[24,38,65,81,117,197,275,325,393,415,430],"SAT":[26,39,42,50,86,95,207,224,229,245,261,348,402],"solver":[27,51,208,246,408,433],"are":[28,337],"highly":[29],"desired.":[30],"This":[31,186,310],"dissertation":[32,215,311],"aims":[33],"enhance":[35],"related":[41],"solving":[43],"problems.":[44],"A":[45],"hybrid":[46,74],"solution":[47,251,352,387],"is":[53,76,102,257,262,353,360,377],"proposed":[54,217,399],"as":[55,165],"an":[56,63,233,249,263,285],"initial":[57],"attack":[58],"this":[60,170,214,431],"dissertation,":[61],"via":[62],"integration":[64],"local":[66],"DPLL-based":[68],"search":[69,119],"approaches.":[70],"Next,":[71],"a":[72,90,98,115,125,143,218,236,244,253,313,323,351,381,406,427],"different":[73],"strategy":[75],"attempted":[77],"that":[78,175,358],"takes":[79],"advantage":[80],"conflicts":[83,343],"search,":[87],"which":[88,266,367,409],"plays":[89],"critical":[91],"role":[92],"modern":[94],"solvers.":[96],"Usually":[97],"learned":[99],"conflict-induced":[100,110],"clause":[101,107,158],"added":[103,130],"back":[104,155],"database.":[108],"Although":[109],"clauses":[111,154,164],"help":[112],"block":[114],"portion":[116],"space,":[120],"they":[121],"can":[122,178,231,279],"also":[123,216,425],"become":[124],"burden":[126],"due":[127],"cost":[131],"memory":[133,184,212],"consumption":[134],"Boolean":[136,167,347],"Constraint":[137],"Propagation":[138],"(BCP).":[139],"We":[140,424],"thus":[141],"propose":[142],"novel":[144,314],"double-layer":[145],"conflict-driven":[146],"learning":[147],"store":[149],"only":[150],"those":[151],"\"primary\"":[152],"conflict":[153,198],"into":[156],"database":[159],"while":[160],"keeping":[161],"other":[163],"pseudo":[166],"constraints.":[168],"With":[169],"approach":[171,177],"our":[172],"experiments":[173,356],"demonstrate":[174,357],"improve":[179],"both":[180],"consumption.":[185],"work":[187,220],"opens":[188],"door":[190],"on":[191,221,296,307,385,397],"how":[192],"assess":[194],"usefulness":[196],"induced":[199],"clauses.":[200],"Besides":[201],"aforementioned":[203],"works":[204],"about":[205],"enhancing":[206],"reducing":[211],"cost,":[213],"contributing":[219],"extended":[223,282],"problem":[225,265],"solving.":[226],"The":[227,335,355],"current":[228],"provide":[232],"assignment":[234,270],"satisfiable":[237],"propositional":[238],"formula.":[239],"However,":[240],"capability":[242],"return":[248],"\"optimal\"":[250],"given":[254],"objective":[255,288,329],"function":[256,330],"severely":[258],"lacking.":[259],"MIN-ONE":[260,297,319,373,401],"optimization":[264],"requires":[267],"satisfying":[269],"with":[271,344,388,420],"minimal":[273],"number":[274],"Ones,":[276],"it":[278],"be":[280,369],"easily":[281],"minimize":[284],"arbitrary":[286],"linear":[287],"function.":[289],"While":[290],"some":[291],"research":[292],"has":[293],"been":[294],"conducted":[295],"SAT,":[298],"existing":[300,372],"algorithms":[301],"do":[302],"not":[303],"scale":[304],"very":[305,364,382],"well":[306],"large":[308,365],"formulas.":[309],"presents":[312],"approximation":[315],"algorithm":[316],"(RelaxSAT)":[317],"SAT.":[320],"RelaxSAT":[321,359,376],"generates":[322],"set":[324],"constraints":[326,336],"from":[327],"guide":[332],"search.":[334],"gradually":[338],"relaxed":[339],"eliminate":[341],"original":[346],"formula":[349],"until":[350],"found.":[354],"able":[361,378],"handle":[363],"instances":[366],"cannot":[368],"solved":[370],"by":[371],"algorithms;":[374],"furthermore,":[375],"obtain":[380],"tight":[383],"bound":[384],"one":[389,413],"two":[391],"orders":[392],"magnitude":[394,416],"speedup.":[395],"Based":[396],"powerful":[400],"algorithm,":[403],"we":[404],"built":[405],"MAX-SAT":[407,422,432],"achieved":[410],"more":[411],"than":[412],"order":[414],"speed":[417],"up":[418],"compared":[419],"the-state-of-art":[421],"solver.":[423],"discuss":[426],"promising":[428],"application":[429],"formal":[435],"verification.":[436]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2017-03-16T00:00:00"}