{"id":"https://openalex.org/W2135350891","doi":"https://doi.org/10.1109/test.2009.5355713","title":"Speeding up bounded sequential equivalence checking with cross-timeframe state-pair constraints from data learning","display_name":"Speeding up bounded sequential equivalence checking with cross-timeframe state-pair constraints from data learning","publication_year":2009,"publication_date":"2009-11-01","ids":{"openalex":"https://openalex.org/W2135350891","doi":"https://doi.org/10.1109/test.2009.5355713","mag":"2135350891"},"language":"en","primary_location":{"id":"doi:10.1109/test.2009.5355713","is_oa":false,"landing_page_url":"https://doi.org/10.1109/test.2009.5355713","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 International Test Conference","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/A5043312206","display_name":"Chia\u2010Ling Chang","orcid":"https://orcid.org/0000-0002-3806-4769"},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chia-Ling Chang","raw_affiliation_strings":["Department of Electrical Engineering, National Chiao Tung University, Hsinchu, Taiwan","Department of Electrical Engineering, National Chiao Tung University, Hsinchu, Taiwan 300#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, National Chiao Tung University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]},{"raw_affiliation_string":"Department of Electrical Engineering, National Chiao Tung University, Hsinchu, Taiwan 300#TAB#","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100682308","display_name":"Charles H.\u2010P. Wen","orcid":"https://orcid.org/0000-0003-4623-9941"},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Charles H.-P. Wen","raw_affiliation_strings":["Department of Electrical Engineering, National Chiao Tung University, Hsinchu, Taiwan","Department of Electrical Engineering, National Chiao Tung University, Hsinchu, Taiwan 300#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, National Chiao Tung University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]},{"raw_affiliation_string":"Department of Electrical Engineering, National Chiao Tung University, Hsinchu, Taiwan 300#TAB#","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108510816","display_name":"Jayanta Bhadra","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jayanta Bhadra","raw_affiliation_strings":["Freescale Semiconductor, Inc., Austin, TX, USA","Freescale Semiconductor Inc., Austin, TX 78729 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Freescale Semiconductor, Inc., Austin, TX, USA","institution_ids":[]},{"raw_affiliation_string":"Freescale Semiconductor Inc., Austin, TX 78729 USA","institution_ids":[]}]}],"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":"27","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9991000294685364,"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.9991000294685364,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9983000159263611,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9977999925613403,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.7582570314407349},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7215190529823303},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6870841979980469},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.582714855670929},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.48715516924858093},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4744880199432373},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4465635418891907},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42193347215652466},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4093736708164215},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34214574098587036},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30288219451904297},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.20520472526550293}],"concepts":[{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.7582570314407349},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7215190529823303},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6870841979980469},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.582714855670929},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.48715516924858093},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4744880199432373},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4465635418891907},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42193347215652466},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4093736708164215},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34214574098587036},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30288219451904297},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.20520472526550293},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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":1,"locations":[{"id":"doi:10.1109/test.2009.5355713","is_oa":false,"landing_page_url":"https://doi.org/10.1109/test.2009.5355713","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 International Test Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1498403163","https://openalex.org/W1518705996","https://openalex.org/W1565377632","https://openalex.org/W1579329129","https://openalex.org/W2057318675","https://openalex.org/W2075959177","https://openalex.org/W2096241967","https://openalex.org/W2098667711","https://openalex.org/W2098847463","https://openalex.org/W2101159578","https://openalex.org/W2103735047","https://openalex.org/W2111991727","https://openalex.org/W2119241964","https://openalex.org/W2126983591","https://openalex.org/W2129369779","https://openalex.org/W2140288930","https://openalex.org/W2142732755","https://openalex.org/W2142785340","https://openalex.org/W2152641842","https://openalex.org/W2160667400","https://openalex.org/W2163730402","https://openalex.org/W2164310930","https://openalex.org/W2166559705","https://openalex.org/W2482589566","https://openalex.org/W4230644986","https://openalex.org/W4247585869","https://openalex.org/W6630973549","https://openalex.org/W6675029967","https://openalex.org/W6679299262","https://openalex.org/W6681020857"],"related_works":["https://openalex.org/W2378211422","https://openalex.org/W4321353415","https://openalex.org/W2745001401","https://openalex.org/W2130974462","https://openalex.org/W2028665553","https://openalex.org/W2086519370","https://openalex.org/W972276598","https://openalex.org/W4246352526","https://openalex.org/W1523834128","https://openalex.org/W3212703233"],"abstract_inverted_index":{"A":[0],"learning-and-filtering":[1],"algorithm":[2],"is":[3,53,77],"proposed":[4,152],"to":[5,41,91,95,107,126],"uncover":[6],"cross-timeframe":[7],"state-pair":[8,48],"constraints":[9,88],"for":[10,26],"speeding":[11],"up":[12],"SAT":[13,97,118],"solving":[14,119],"of":[15,38,46,73,139],"bounded":[16],"sequential":[17],"equivalence":[18],"checking":[19],"(BSEC)":[20],"problems.":[21,111],"First,":[22],"relaxed":[23],"Boolean":[24],"functions":[25],"flip-flop":[27],"states":[28],"at":[29],"respective":[30],"timeframes":[31,140],"are":[32,89,102],"learned":[33],"from":[34],"a":[35,62,133],"small":[36],"number":[37,138],"simulation":[39],"data":[40],"derive":[42],"the":[43,47,68,71,74,80,86,92,116,136,151],"initial":[44],"set":[45],"candidates.":[49],"Next,":[50],"each":[51],"candidate":[52,63],"examined":[54],"and":[55],"removed":[56],"if":[57],"both":[58],"values":[59],"in":[60,123],"such":[61],"have":[64],"coordinately":[65],"appeared":[66],"during":[67],"simulation.":[69],"Then,":[70],"validity":[72],"remaining":[75],"candidates":[76],"checked":[78],"against":[79],"corresponding":[81],"augmented":[82],"circuit.":[83],"Last,":[84],"only":[85],"true":[87],"annotated":[90],"BSEC":[93,110],"problems":[94],"facilitate":[96],"solving.":[98],"All":[99],"benchmark":[100],"circuits":[101,148],"synthesized":[103],"under":[104],"10":[105],"configurations":[106],"produce":[108],"different":[109],"Experimental":[112],"results":[113],"show":[114],"that":[115],"new":[117],"runs":[120],"2-order":[121],"faster":[122],"average":[124],"compared":[125],"using":[127],"MiniSAT":[128],"2.0":[129],"only.":[130],"Moreover,":[131],"given":[132],"time":[134],"bound,":[135],"total":[137],"can":[141],"increase":[142],"by":[143],"8X-20X":[144],"on":[145],"4":[146],"larger":[147],"after":[149],"applying":[150],"framework.":[153]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}