{"id":"https://openalex.org/W2120485094","doi":"https://doi.org/10.1145/1146909.1146972","title":"Fast illegal state identification for improving SAT-based induction","display_name":"Fast illegal state identification for improving SAT-based induction","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2120485094","doi":"https://doi.org/10.1145/1146909.1146972","mag":"2120485094"},"language":"en","primary_location":{"id":"doi:10.1145/1146909.1146972","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1146909.1146972","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd annual conference on Design automation - DAC '06","raw_type":"proceedings-article"},"type":"conference-paper","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/A5049735113","display_name":"Vishnu C. Vimjam","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vishnu C. Vimjam","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5108516165","display_name":"Michael S. Hsiao","orcid":null},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael S. Hsiao","raw_affiliation_strings":["Dept. of ECE, Virginia Tech, Blacksburg, VA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of ECE, Virginia Tech, Blacksburg, VA","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"241","last_page":"241"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9998999834060669,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9998999834060669,"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/T12122","display_name":"Physical Unclonable Functions (PUFs) and Hardware Security","score":0.9991999864578247,"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.9986000061035156,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/identification","display_name":"Identification (biology)","score":0.6545937657356262},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5404682159423828},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4463924169540405},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1080700159072876}],"concepts":[{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.6545937657356262},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5404682159423828},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4463924169540405},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1080700159072876},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C59822182","wikidata":"https://www.wikidata.org/wiki/Q441","display_name":"Botany","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1146909.1146972","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1146909.1146972","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd annual conference on Design automation - DAC '06","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.215.335","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.335","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7799999713897705,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1495266209","https://openalex.org/W1503170978","https://openalex.org/W1517173520","https://openalex.org/W1524329362","https://openalex.org/W1549820563","https://openalex.org/W1552280794","https://openalex.org/W1574850141","https://openalex.org/W1787074469","https://openalex.org/W1889322523","https://openalex.org/W1977294468","https://openalex.org/W2046239089","https://openalex.org/W2048413377","https://openalex.org/W2062897452","https://openalex.org/W2075959177","https://openalex.org/W2111265695","https://openalex.org/W2123736383","https://openalex.org/W2142785340","https://openalex.org/W2145117664","https://openalex.org/W2149107969","https://openalex.org/W2158910854","https://openalex.org/W2160130484","https://openalex.org/W2225800216","https://openalex.org/W2340735175"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2130043461","https://openalex.org/W2530322880"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,29,45,58,76],"propose":[4,46],"a":[5,14,31,78],"novel":[6],"framework":[7,80],"to":[8,35,52,64,112,121],"quickly":[9],"extract":[10],"illegal":[11,96],"states":[12,97],"of":[13,41,49],"sequential":[15,68],"circuit":[16,73],"and":[17,87,103,134],"then":[18],"use":[19,77],"them":[20],"as":[21],"constraints":[22],"during":[23],"the":[24,47,60,72,84,91,94,108,114,122,135],"SAT-based":[25],"induction":[26,136],"runs.":[27],"First,":[28],"employ":[30],"low-cost":[32],"combinational":[33],"ATPG":[34],"identify":[36,53],"unreachable":[37],"partial-states":[38],"among":[39,71],"groups":[40],"related":[42],"flip-flops.":[43],"Second,":[44],"concept":[48],"necessary-assignment":[50],"looping":[51],"additional":[54],"unachievable":[55],"partial-states.":[56],"Third,":[57],"extend":[59],"above":[61,85],"unachievability":[62],"theory":[63],"capture":[65],"new":[66],"non-trivial":[67],"logic":[69],"dependencies":[70],"signals.":[74],"Finally,":[75],"unified":[79],"that":[81],"utilizes":[82],"all":[83,107],"information":[86],"aims":[88],"at":[89,106,131],"maximizing":[90],"learning.":[92],"All":[93],"learned":[95],"are":[98,104],"converted":[99],"into":[100],"constraint":[101],"clauses":[102],"replicated":[105],"unrolled":[109],"transition":[110],"relations":[111],"prune":[113],"searchspace.":[115],"Experimental":[116],"results":[117],"show":[118],"that,":[119],"due":[120],"added":[123],"constraints,":[124],"many":[125],"safety":[126],"properties":[127],"can":[128,138],"be":[129,139],"proved":[130],"earlier":[132],"depths":[133],"run-times":[137],"significantly":[140],"reduced.":[141]},"counts_by_year":[{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-19T07:52:34.831488","created_date":"2025-10-10T00:00:00"}