{"id":"https://openalex.org/W2112748651","doi":"https://doi.org/10.1109/isvlsi.2002.1016889","title":"Improving structural FSM traversal by constraint-satisfying logic simulation","display_name":"Improving structural FSM traversal by constraint-satisfying logic simulation","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2112748651","doi":"https://doi.org/10.1109/isvlsi.2002.1016889","mag":"2112748651"},"language":"en","primary_location":{"id":"doi:10.1109/isvlsi.2002.1016889","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isvlsi.2002.1016889","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings IEEE Computer Society Annual Symposium on VLSI. New Paradigms for VLSI Systems Design. ISVLSI 2002","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/A5020337959","display_name":"Markus Wedler","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"M. Wedler","raw_affiliation_strings":["Department of Electrical Engineering and Information Technology Electronic Design Automation Group, University of Kaiserslautern, Germany","Dept. of Electr. Eng. & Inf. Technol., Kaiserslautern Univ., Germany"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Information Technology Electronic Design Automation Group, University of Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]},{"raw_affiliation_string":"Dept. of Electr. Eng. & Inf. Technol., Kaiserslautern Univ., Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047920654","display_name":"Dominik Stoffel","orcid":"https://orcid.org/0000-0002-8180-9738"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"D. Stoffel","raw_affiliation_strings":["Department of Electrical Engineering and Information Technology Electronic Design Automation Group, University of Kaiserslautern, Germany","Dept. of Electr. Eng. & Inf. Technol., Kaiserslautern Univ., Germany"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Information Technology Electronic Design Automation Group, University of Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]},{"raw_affiliation_string":"Dept. of Electr. Eng. & Inf. Technol., Kaiserslautern Univ., Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066184879","display_name":"Wolfgang Kunz","orcid":"https://orcid.org/0000-0002-6612-2946"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"W. Kunz","raw_affiliation_strings":["Department of Electrical Engineering and Information Technology Electronic Design Automation Group, University of Kaiserslautern, Germany","Dept. of Electr. Eng. & Inf. Technol., Kaiserslautern Univ., Germany"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Information Technology Electronic Design Automation Group, University of Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]},{"raw_affiliation_string":"Dept. of Electr. Eng. & Inf. Technol., Kaiserslautern Univ., Germany","institution_ids":["https://openalex.org/I153267046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5020337959"],"corresponding_institution_ids":["https://openalex.org/I153267046"],"apc_list":null,"apc_paid":null,"fwci":2.127,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.87687822,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"151","last_page":"158"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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.9993000030517578,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9969000220298767,"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/tree-traversal","display_name":"Tree traversal","score":0.8726391792297363},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6590814590454102},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6417183876037598},{"id":"https://openalex.org/keywords/frame","display_name":"Frame (networking)","score":0.5838995575904846},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5766811966896057},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5749635100364685},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5091425776481628},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4885779321193695},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47729647159576416},{"id":"https://openalex.org/keywords/combinational-logic","display_name":"Combinational logic","score":0.4444625675678253},{"id":"https://openalex.org/keywords/sequential-logic","display_name":"Sequential logic","score":0.44433072209358215},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.30006855726242065},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.24521422386169434},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22294870018959045},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.184671550989151}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.8726391792297363},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6590814590454102},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6417183876037598},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.5838995575904846},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5766811966896057},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5749635100364685},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5091425776481628},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4885779321193695},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47729647159576416},{"id":"https://openalex.org/C81409106","wikidata":"https://www.wikidata.org/wiki/Q76505","display_name":"Combinational logic","level":3,"score":0.4444625675678253},{"id":"https://openalex.org/C187075797","wikidata":"https://www.wikidata.org/wiki/Q173245","display_name":"Sequential logic","level":3,"score":0.44433072209358215},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.30006855726242065},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.24521422386169434},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22294870018959045},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.184671550989151},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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":"doi:10.1109/isvlsi.2002.1016889","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isvlsi.2002.1016889","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings IEEE Computer Society Annual Symposium on VLSI. New Paradigms for VLSI Systems Design. ISVLSI 2002","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":24,"referenced_works":["https://openalex.org/W1503170978","https://openalex.org/W1549820563","https://openalex.org/W1992006255","https://openalex.org/W2051111453","https://openalex.org/W2053446892","https://openalex.org/W2069560114","https://openalex.org/W2073306964","https://openalex.org/W2080267935","https://openalex.org/W2116242425","https://openalex.org/W2123736383","https://openalex.org/W2137035823","https://openalex.org/W2155562553","https://openalex.org/W2162226695","https://openalex.org/W2162558294","https://openalex.org/W2168528936","https://openalex.org/W3146212543","https://openalex.org/W4230009915","https://openalex.org/W4230586716","https://openalex.org/W4241530675","https://openalex.org/W4243399171","https://openalex.org/W4251370346","https://openalex.org/W4300021588","https://openalex.org/W6668679965","https://openalex.org/W6683854672"],"related_works":["https://openalex.org/W29481652","https://openalex.org/W4238178324","https://openalex.org/W4248668797","https://openalex.org/W2110968362","https://openalex.org/W3141297747","https://openalex.org/W2106889348","https://openalex.org/W2111485030","https://openalex.org/W4390345338","https://openalex.org/W96064250","https://openalex.org/W2884916459"],"abstract_inverted_index":{"We":[0],"increase":[1],"the":[2,6,42,47,81,88,91],"reasoning":[3],"power":[4],"of":[5,45,49,90],"Record":[7,57],"&":[8,58],"Play":[9,59],"algorithm":[10],"for":[11,34],"structural":[12],"FSM":[13],"traversal":[14],"(Stoffel":[15],"and":[16,74],"Kunz,":[17],"1997),":[18],"by":[19],"incorporating":[20],"a":[21,63],"constraint-satisfying":[22],"simulation":[23,30,65],"technique.":[24],"Combinational":[25],"verification":[26],"tools":[27],"often":[28],"use":[29],"to":[31,55,61,79],"identify":[32],"candidates":[33],"internally":[35],"equivalent":[36],"functions.":[37],"This":[38],"can":[39],"significantly":[40],"reduce":[41],"computational":[43],"costs":[44],"proving":[46],"equivalence":[48],"two":[50],"circuits.":[51],"The":[52],"key":[53],"idea":[54],"improve":[56],"is":[60],"perform":[62],"random":[64],"in":[66],"every":[67],"time":[68],"frame":[69],"that":[70],"satisfies":[71],"stored":[72],"equivalences":[73],"constants":[75],"which":[76],"are":[77],"needed":[78],"represent":[80],"state":[82],"set.":[83],"Our":[84],"experimental":[85],"results":[86],"show":[87],"benefit":[89],"proposed":[92],"approach.":[93]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}