{"id":"https://openalex.org/W2111991727","doi":"https://doi.org/10.1145/1146909.1147098","title":"Mining global constraints for improving bounded sequential equivalence checking","display_name":"Mining global constraints for improving bounded sequential equivalence checking","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2111991727","doi":"https://doi.org/10.1145/1146909.1147098","mag":"2111991727"},"language":"en","primary_location":{"id":"doi:10.1145/1146909.1147098","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1146909.1147098","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":"article","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/A5062689387","display_name":"Weixin Wu","orcid":"https://orcid.org/0000-0003-3246-2042"},"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":true,"raw_author_name":"Weixin Wu","raw_affiliation_strings":["Virginia Tech., Blacksburg, VA","[Dept. of Electr. & Comput. Eng., Virginia Tech, Blacksburg, VA, USA]"],"affiliations":[{"raw_affiliation_string":"Virginia Tech., Blacksburg, VA","institution_ids":["https://openalex.org/I859038795"]},{"raw_affiliation_string":"[Dept. of Electr. & Comput. Eng., Virginia Tech, Blacksburg, VA, USA]","institution_ids":["https://openalex.org/I859038795"]}]},{"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":["Virginia Tech., Blacksburg, VA","[Dept. of Electr. & Comput. Eng., Virginia Tech, Blacksburg, VA, USA]"],"affiliations":[{"raw_affiliation_string":"Virginia Tech., Blacksburg, VA","institution_ids":["https://openalex.org/I859038795"]},{"raw_affiliation_string":"[Dept. of Electr. & Comput. Eng., Virginia Tech, Blacksburg, VA, USA]","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062689387"],"corresponding_institution_ids":["https://openalex.org/I859038795"],"apc_list":null,"apc_paid":null,"fwci":3.7076,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.93231953,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"743","last_page":"743"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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.9994000196456909,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9828000068664551,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9768000245094299,"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/bounded-function","display_name":"Bounded function","score":0.7607423067092896},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7534032464027405},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7485626935958862},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.7118493318557739},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5647109150886536},{"id":"https://openalex.org/keywords/contrast","display_name":"Contrast (vision)","score":0.5381646156311035},{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.43825310468673706},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.42992204427719116},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4193195700645447},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3952091932296753},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2153639793395996},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.19146376848220825},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16808035969734192},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.07840666174888611}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7607423067092896},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7534032464027405},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7485626935958862},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.7118493318557739},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5647109150886536},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.5381646156311035},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.43825310468673706},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.42992204427719116},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4193195700645447},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3952091932296753},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2153639793395996},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.19146376848220825},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16808035969734192},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.07840666174888611},{"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":2,"locations":[{"id":"doi:10.1145/1146909.1147098","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1146909.1147098","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.474.5085","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.474.5085","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.eecs.umich.edu/~valeria/teaching/eecs578_F09_old/papers/wu06.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1566041312","https://openalex.org/W1916451820","https://openalex.org/W1976140238","https://openalex.org/W1991547699","https://openalex.org/W2024148935","https://openalex.org/W2060090911","https://openalex.org/W2075959177","https://openalex.org/W2100406636","https://openalex.org/W2103735047","https://openalex.org/W2111523115","https://openalex.org/W2115780004","https://openalex.org/W2119241964","https://openalex.org/W2128967345","https://openalex.org/W2129369779","https://openalex.org/W2137442640","https://openalex.org/W2142732755","https://openalex.org/W2142785340","https://openalex.org/W2145117664","https://openalex.org/W2147897801","https://openalex.org/W2151773147","https://openalex.org/W2161273503","https://openalex.org/W2163730402","https://openalex.org/W2165370339","https://openalex.org/W2166559705","https://openalex.org/W2613161123"],"related_works":["https://openalex.org/W2117120663","https://openalex.org/W1532304424","https://openalex.org/W2122228234","https://openalex.org/W2116137315","https://openalex.org/W1915669309","https://openalex.org/W1537651185","https://openalex.org/W1583869287","https://openalex.org/W2365988016","https://openalex.org/W1547517160","https://openalex.org/W2060070465"],"abstract_inverted_index":{"In":[0,19,78],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,12],"novel":[6],"technique":[7],"on":[8],"mining":[9,27],"relationships":[10,32],"in":[11],"sequential":[13,66],"circuit":[14],"to":[15,21,63,72,84,92],"discover":[16],"global":[17,61],"constraints.":[18],"contrast":[20],"the":[22,47,50,57,85,94],"traditional":[23],"learning":[24],"methods,":[25],"our":[26],"algorithm":[28],"can":[29,69,90],"find":[30],"important":[31],"among":[33],"several":[34,43],"nodes":[35,38],"efficiently.":[36],"The":[37],"involved":[39],"may":[40],"often":[41],"span":[42],"time-frames,":[44],"thus":[45],"improving":[46],"deductibility":[48],"of":[49,59,75,96],"problem":[51],"instance.":[52],"Experimental":[53],"results":[54],"demonstrate":[55],"that":[56],"application":[58],"these":[60],"constraints":[62],"SAT-based":[64],"bounded":[65],"equivalence":[67],"checking":[68],"achieve":[70],"one":[71],"two":[73],"orders":[74],"magnitude":[76],"speedup.":[77],"addition,":[79],"because":[80],"it":[81,89],"is":[82],"orthogonal":[83],"underlying":[86],"SAT":[87,98],"solver,":[88],"help":[91],"enhance":[93],"efficacy":[95],"typical":[97],"based":[99],"verification":[100],"flows.":[101]},"counts_by_year":[{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}