{"id":"https://openalex.org/W35365073","doi":null,"title":"Algorithms and data structures for logic synthesis and verification using boolean satisfiability","display_name":"Algorithms and data structures for logic synthesis and verification using boolean satisfiability","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W35365073","mag":"35365073"},"language":"en","primary_location":{"id":"mag:35365073","doi":null,"is_oa":false,"landing_page_url":"http://loonwerks.com/publications/pdf/backes2013phd.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},"volume":null,"type":"dissertation","indexed_in":[],"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/A5069435775","display_name":"Marcus D. Riedel","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marcus D. Riedel","raw_affiliation_strings":["University of\u00a0Minnesota"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of\u00a0Minnesota","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044441669","display_name":"John Backes","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Backes","raw_affiliation_strings":["University of\u00a0Minnesota"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of\u00a0Minnesota","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130238516"],"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.9218999743461609,"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.9218999743461609,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.034699998795986176,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.0032999999821186066,"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/boolean-satisfiability","display_name":"Boolean satisfiability","score":0.9810000061988831},{"id":"https://openalex.org/keywords/logic-synthesis","display_name":"logic synthesis","score":0.9290000200271606},{"id":"https://openalex.org/keywords/formal-verification","display_name":"formal verification","score":0.7289999723434448},{"id":"https://openalex.org/keywords/feedback-circuits","display_name":"feedback circuits","score":0.5270000100135803},{"id":"https://openalex.org/keywords/unsatisfiability-proofs","display_name":"unsatisfiability proofs","score":0.9430000185966492},{"id":"https://openalex.org/keywords/property-directed-reachability","display_name":"property directed reachability","score":0.8209999799728394},{"id":"https://openalex.org/keywords/model-checking","display_name":"model checking","score":0.9589999914169312},{"id":"https://openalex.org/keywords/sequential-circuits","display_name":"sequential circuits","score":0.7760000228881836},{"id":"https://openalex.org/keywords/state-invariants","display_name":"state invariants","score":0.8740000128746033}],"concepts":[{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.7866743803024292},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.7561904191970825},{"id":"https://openalex.org/C81409106","wikidata":"https://www.wikidata.org/wiki/Q76505","display_name":"Combinational logic","level":3,"score":0.6161117553710938},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.5845651030540466},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.557624876499176},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.53531813621521},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5322805643081665},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5140389204025269},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4973130524158478},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4773305058479309},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4671005308628082},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45596688985824585},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.4377460479736328},{"id":"https://openalex.org/C39685927","wikidata":"https://www.wikidata.org/wiki/Q173183","display_name":"Boolean algebra","level":2,"score":0.4290798604488373},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.41502898931503296},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.40292495489120483},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3496819734573364},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"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":1,"locations":[{"id":"mag:35365073","doi":null,"is_oa":false,"landing_page_url":"http://loonwerks.com/publications/pdf/backes2013phd.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":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[{"display_name":"Peace, justice, and strong institutions","score":0.7099999785423279,"id":"https://metadata.un.org/sdg/16"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":64,"referenced_works":["https://openalex.org/W25571951","https://openalex.org/W78552530","https://openalex.org/W81626549","https://openalex.org/W1484594398","https://openalex.org/W1485781696","https://openalex.org/W1495106406","https://openalex.org/W1495266209","https://openalex.org/W1496529478","https://openalex.org/W1503170978","https://openalex.org/W1510132912","https://openalex.org/W1510368738","https://openalex.org/W1511688816","https://openalex.org/W1518705996","https://openalex.org/W1549166962","https://openalex.org/W1561934984","https://openalex.org/W1563456403","https://openalex.org/W1564947547","https://openalex.org/W1566132409","https://openalex.org/W1586677474","https://openalex.org/W1608279203","https://openalex.org/W1806449990","https://openalex.org/W1950282396","https://openalex.org/W1989912322","https://openalex.org/W1990190087","https://openalex.org/W2001289891","https://openalex.org/W2004306067","https://openalex.org/W2010065567","https://openalex.org/W2023808162","https://openalex.org/W2024148935","https://openalex.org/W2024223745","https://openalex.org/W2033176194","https://openalex.org/W2035561773","https://openalex.org/W2044095368","https://openalex.org/W2048051309","https://openalex.org/W2053068495","https://openalex.org/W2057361103","https://openalex.org/W2067776562","https://openalex.org/W2080267935","https://openalex.org/W2094204687","https://openalex.org/W2095698047","https://openalex.org/W2100465945","https://openalex.org/W2105761964","https://openalex.org/W2106950603","https://openalex.org/W2118382442","https://openalex.org/W2118551933","https://openalex.org/W2118791871","https://openalex.org/W2120223433","https://openalex.org/W2125607701","https://openalex.org/W2125850227","https://openalex.org/W2126900870","https://openalex.org/W2142785340","https://openalex.org/W2146662253","https://openalex.org/W2147348835","https://openalex.org/W2150517041","https://openalex.org/W2158135227","https://openalex.org/W2158748448","https://openalex.org/W2159318488","https://openalex.org/W2159503942","https://openalex.org/W2160156809","https://openalex.org/W2160776998","https://openalex.org/W2335478831","https://openalex.org/W3004540582","https://openalex.org/W3141112769","https://openalex.org/W3144889436"],"related_works":["https://openalex.org/W2092333098","https://openalex.org/W3141812019","https://openalex.org/W2291810475","https://openalex.org/W7100803788","https://openalex.org/W4413122509","https://openalex.org/W2094204687","https://openalex.org/W2157533144","https://openalex.org/W4200383047","https://openalex.org/W7096028613","https://openalex.org/W2118613560"],"abstract_inverted_index":{"Boolean":[0,38,115],"satisfiability":[1],"(SAT)":[2],"was":[3],"the":[4,68,71,168,180,237,244,247,258,265,281],"first":[5],"problem":[6],"to":[7,10,42,89,178,182,208,227,290,318],"be":[8,11,31,90,112,142,188,206],"proven":[9],"NP-Complete.":[12],"The":[13,40,117],"proof,":[14],"provided":[15],"by":[16,25,33,120],"Stephen":[17],"Cook":[18],"in":[19,95,106,159,316],"1971,":[20],"demonstrated":[21],"that":[22,85,131,320],"inputs":[23],"accepted":[24],"a":[26,37,47,81,148,291,313,321],"non-deterministic":[27],"Turing":[28],"machine":[29],"can":[30,111,141,187,205],"described":[32],"satisfying":[34],"assignments":[35],"of":[36,49,58,73,194,225,246,250,260,267,269,284,312],"formula.":[39],"reduction":[41],"SAT":[43,64,74,306],"feels":[44],"natural":[45],"for":[46,62,256,276],"wealth":[48],"decision":[50],"problems;":[51],"this":[52,99,197,251,285],"has":[53,76],"motivated":[54],"an":[55,153,192,272],"immense":[56],"amount":[57],"research":[59],"into":[60],"heuristics":[61],"solving":[63],"instances":[65,307],"quickly.":[66],"Over":[67],"past":[69],"decade":[70],"performance":[72],"solvers":[75],"improved":[77],"tremendously,":[78],"and":[79,109,174,236,263],"as":[80,191,271,297],"consequence,":[82],"real-world":[83],"problems":[84,105],"were":[86],"once":[87],"thought":[88],"intractable":[91],"are":[92,128,240,243,254],"now":[93],"feasible":[94],"many":[96],"cases.":[97],"\r\nIn":[98],"thesis":[100,198,286],"we":[101],"discuss":[102],"how":[103,177,200],"some":[104,288],"logic":[107,129],"synthesis":[108,203,219,277],"verification":[110],"solved":[113],"with":[114,144],"satisfiability.":[116],"dissertation":[118],"begins":[119],"discussing":[121],"Cyclic":[122,125],"Combinational":[123,126],"Circuits.":[124],"Circuits":[127],"circuits":[130,162],"contain":[132],"feedback,":[133],"but":[134],"exhibit":[135],"no":[136],"state":[137,322],"behavior.":[138],"Many":[139],"functions":[140],"implemented":[143],"fewer":[145],"gates":[146],"using":[147],"cyclic":[149,210],"topology":[150],"rather":[151,212],"than":[152,213],"acyclic":[154],"topology.":[155],"A":[156],"pivotal":[157],"step":[158],"synthesizing":[160],"these":[161,261],"is":[163,171,278],"proving":[164],"whether":[165],"or":[166],"not":[167],"resulting":[169],"structure":[170,275],"actually":[172],"combinational,":[173],"if":[175],"not,":[176],"modify":[179],"circuit":[181,229,315],"behave":[183],"properly.":[184],"This":[185,302],"analysis":[186],"elegantly":[189],"cast":[190],"instance":[193],"SAT.":[195],"Furthermore,":[196],"demonstrates":[199],"modern":[201],"SAT-Based":[202,218],"techniques":[204,220],"used":[207],"generate":[209,228],"structures,":[211,232],"just":[214],"analyze":[215],"them.":[216],"\r\nThese":[217],"rely":[221],"on":[222],"augmenting":[223],"proofs":[224,238,268],"unsatisfiability":[226,270],"structures.":[230],"These":[231],"called":[233],"Craig":[234],"Interpolants,":[235],"they":[239],"generated":[241],"from":[242],"focus":[245],"second":[248],"portion":[249,283],"dissertation.":[252],"Techniques":[253],"proposed":[255],"reducing":[257],"size":[259],"interpolants,":[262],"then":[264],"use":[266],"underlying":[273],"data":[274],"advocated.":[279],"\r\nFinally,":[280],"last":[282],"discusses":[287],"improvements":[289],"new":[292],"model":[293],"checking":[294],"algorithm":[295,303],"known":[296],"Property":[298],"Directed":[299],"Reachability":[300],"(PDR).":[301],"iteratively":[304],"solves":[305],"representing":[308],"discrete":[309],"time":[310],"frames":[311],"sequential":[314],"order":[317],"demonstrate":[319],"invariant":[323],"exists.":[324]},"counts_by_year":[],"updated_date":"2026-08-08T07:41:36.138363","created_date":"2016-06-24T00:00:00"}