{"id":"https://openalex.org/W1994321524","doi":"https://doi.org/10.1109/hldvt.2012.6418236","title":"Sequential equivalence checking of hard instances with targeted inductive invariants and efficient filtering strategies","display_name":"Sequential equivalence checking of hard instances with targeted inductive invariants and efficient filtering strategies","publication_year":2012,"publication_date":"2012-11-01","ids":{"openalex":"https://openalex.org/W1994321524","doi":"https://doi.org/10.1109/hldvt.2012.6418236","mag":"1994321524"},"language":"en","primary_location":{"id":"doi:10.1109/hldvt.2012.6418236","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hldvt.2012.6418236","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International High Level Design Validation and Test Workshop (HLDVT)","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/A5102936404","display_name":"Huy L. Nguy\u00ean","orcid":"https://orcid.org/0000-0001-5128-6545"},"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":"Huy Nguyen","raw_affiliation_strings":["Bradley Department of Electrical and Computer Engineering, Virginia Technology, Blacksburg, VA, USA","Bradley Department of Electrical and Computer Engineering, Virginia Tech, Blacksburg VA 24061, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bradley Department of Electrical and Computer Engineering, Virginia Technology, Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]},{"raw_affiliation_string":"Bradley Department of Electrical and Computer Engineering, Virginia Tech, Blacksburg VA 24061, 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":["Bradley Department of Electrical and Computer Engineering, Virginia Technology, Blacksburg, VA, USA","Bradley Department of Electrical and Computer Engineering, Virginia Tech, Blacksburg VA 24061, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bradley Department of Electrical and Computer Engineering, Virginia Technology, Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]},{"raw_affiliation_string":"Bradley Department of Electrical and Computer Engineering, Virginia Tech, Blacksburg VA 24061, USA","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I859038795"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"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.9998999834060669,"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.9998999834060669,"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.9951000213623047,"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.9922000169754028,"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/speedup","display_name":"Speedup","score":0.805108368396759},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6869642734527588},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.668256402015686},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6620436310768127},{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.6560109853744507},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.5511170029640198},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4648664593696594},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4080123007297516},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37570735812187195},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21798110008239746},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2081787884235382},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.09143480658531189}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.805108368396759},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6869642734527588},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.668256402015686},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6620436310768127},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.6560109853744507},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.5511170029640198},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4648664593696594},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4080123007297516},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37570735812187195},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21798110008239746},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2081787884235382},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.09143480658531189},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hldvt.2012.6418236","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hldvt.2012.6418236","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International High Level Design Validation and Test Workshop (HLDVT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W96727551","https://openalex.org/W1495266209","https://openalex.org/W1552280794","https://openalex.org/W1566041312","https://openalex.org/W2024148935","https://openalex.org/W2056597596","https://openalex.org/W2101159578","https://openalex.org/W2111991727","https://openalex.org/W2115780004","https://openalex.org/W2118916888","https://openalex.org/W2135350891","https://openalex.org/W2138728917","https://openalex.org/W2142785340","https://openalex.org/W2145117664","https://openalex.org/W2151398141","https://openalex.org/W2153335387","https://openalex.org/W2156661714","https://openalex.org/W2161215542","https://openalex.org/W2164310930","https://openalex.org/W4230644986","https://openalex.org/W4241233758","https://openalex.org/W6603945456","https://openalex.org/W6629648295","https://openalex.org/W6664585280","https://openalex.org/W6677349481","https://openalex.org/W6677934218","https://openalex.org/W6680370635","https://openalex.org/W6682383673","https://openalex.org/W6682981355"],"related_works":["https://openalex.org/W2117120663","https://openalex.org/W1532304424","https://openalex.org/W2122228234","https://openalex.org/W2116137315","https://openalex.org/W1537651185","https://openalex.org/W1583869287","https://openalex.org/W2365988016","https://openalex.org/W1547517160","https://openalex.org/W2372104150","https://openalex.org/W2102175714"],"abstract_inverted_index":{"We":[0,39],"propose":[1],"two":[2,20],"approaches":[3],"to":[4,35,45,55,58,89],"significantly":[5],"boost":[6],"the":[7,47,61,68],"power":[8],"of":[9,49,92],"sequential":[10],"equivalence":[11],"checking:":[12],"(1)":[13],"In":[14],"contrast":[15],"with":[16,76],"invariants":[17,52],"involving":[18],"only":[19],"or":[21,78],"three":[22,90],"signals,":[23],"we":[24],"introduce":[25],"a":[26],"novel":[27],"multisignal":[28],"invariant":[29],"generation":[30],"technique":[31],"that":[32,53,67,82],"is":[33],"scalable":[34],"large":[36],"circuits;":[37],"(2)":[38],"utilize":[40],"static":[41],"and":[42],"dynamic":[43],"filters":[44],"reduce":[46,60],"number":[48],"potential":[50],"inductive":[51],"need":[54],"be":[56],"proved":[57],"further":[59],"computational":[62],"cost.":[63],"Experimental":[64],"results":[65],"show":[66],"proposed":[69],"method":[70],"can":[71],"handle":[72],"hard":[73],"SEC":[74],"instances":[75],"little":[77],"no":[79],"internal":[80],"equivalences":[81],"conventional":[83],"methods":[84],"fail;":[85],"in":[86],"addition,":[87],"one":[88],"orders":[91],"magnitude":[93],"speedup":[94],"have":[95],"been":[96],"achieved":[97],"for":[98],"many":[99],"instances.":[100]},"counts_by_year":[{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}