{"id":"https://openalex.org/W2553206079","doi":"https://doi.org/10.1109/hldvt.2016.7748268","title":"Word-level traversal of finite state machines using algebraic geometry","display_name":"Word-level traversal of finite state machines using algebraic geometry","publication_year":2016,"publication_date":"2016-10-01","ids":{"openalex":"https://openalex.org/W2553206079","doi":"https://doi.org/10.1109/hldvt.2016.7748268","mag":"2553206079"},"language":"en","primary_location":{"id":"doi:10.1109/hldvt.2016.7748268","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hldvt.2016.7748268","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International High Level Design Validation and Test Workshop (HLDVT)","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/A5101738775","display_name":"Xiaojun Sun","orcid":"https://orcid.org/0000-0002-1366-213X"},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xiaojun Sun","raw_affiliation_strings":["Electrical & Computer Engineering, University of Utah, Salt Lake City, UT"],"affiliations":[{"raw_affiliation_string":"Electrical & Computer Engineering, University of Utah, Salt Lake City, UT","institution_ids":["https://openalex.org/I223532165"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048751210","display_name":"Priyank Kalla","orcid":"https://orcid.org/0000-0001-7412-5138"},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Priyank Kalla","raw_affiliation_strings":["Electrical & Computer Engineering, University of Utah, Salt Lake City, UT"],"affiliations":[{"raw_affiliation_string":"Electrical & Computer Engineering, University of Utah, Salt Lake City, UT","institution_ids":["https://openalex.org/I223532165"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041901796","display_name":"Florian Enescu","orcid":"https://orcid.org/0000-0002-9532-2568"},"institutions":[{"id":"https://openalex.org/I181565077","display_name":"Georgia State University","ror":"https://ror.org/03qt6ba18","country_code":"US","type":"education","lineage":["https://openalex.org/I181565077"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Florian Enescu","raw_affiliation_strings":["Mathematics & Statistics, Georgia State University, Atlanta, GA"],"affiliations":[{"raw_affiliation_string":"Mathematics & Statistics, Georgia State University, Atlanta, GA","institution_ids":["https://openalex.org/I181565077"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101738775"],"corresponding_institution_ids":["https://openalex.org/I223532165"],"apc_list":null,"apc_paid":null,"fwci":1.3939,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.8408377,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"142","last_page":"149"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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.9997000098228455,"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.9980999827384949,"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/T11130","display_name":"Coding theory and cryptography","score":0.9977999925613403,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.7408629655838013},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.6659992933273315},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6313326358795166},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.5635714530944824},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5174735188484192},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.47432395815849304},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.45957136154174805},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.4517783224582672},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4460752308368683},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4277323782444},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41609394550323486},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41569316387176514},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.41080984473228455},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3521297872066498},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.34731873869895935},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.33991044759750366},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.13067781925201416}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7408629655838013},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.6659992933273315},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6313326358795166},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.5635714530944824},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5174735188484192},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.47432395815849304},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.45957136154174805},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.4517783224582672},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4460752308368683},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4277323782444},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41609394550323486},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41569316387176514},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.41080984473228455},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3521297872066498},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.34731873869895935},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.33991044759750366},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.13067781925201416},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/hldvt.2016.7748268","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hldvt.2016.7748268","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1482981524","https://openalex.org/W1518341038","https://openalex.org/W1535542288","https://openalex.org/W1549166962","https://openalex.org/W1822320350","https://openalex.org/W1984993577","https://openalex.org/W1992006255","https://openalex.org/W2035842864","https://openalex.org/W2145785237","https://openalex.org/W2150119568","https://openalex.org/W2164829820","https://openalex.org/W2175098281","https://openalex.org/W2344855325","https://openalex.org/W2613956024","https://openalex.org/W3138459719","https://openalex.org/W4235915188"],"related_works":["https://openalex.org/W4250225510","https://openalex.org/W1979520342","https://openalex.org/W1983064190","https://openalex.org/W1482370337","https://openalex.org/W4214727065","https://openalex.org/W1983158716","https://openalex.org/W2906490231","https://openalex.org/W1571429055","https://openalex.org/W1485984004","https://openalex.org/W2111868903"],"abstract_inverted_index":{"Reachability":[0],"analysis":[1],"is":[2,51,108],"a":[3,56,81,92,113,151],"tool":[4],"for":[5,128],"formal":[6],"equivalence":[7],"and":[8,26,35,43,122,141],"model":[9],"checking":[10],"of":[11,49,59,63,80,91,112,119,137,145,153],"sequential":[12,82,154],"circuits.":[13],"Conventional":[14],"techniques":[15],"are":[16,29],"mostly":[17],"bit-level,":[18],"in":[19],"that":[20,77],"the":[21,70,78,89,98,109,134,143,146],"reachable":[22],"states,":[23],"transition":[24],"relations":[25],"property":[27],"predicates":[28],"all":[30],"represented":[31],"using":[32],"Boolean":[33],"variables":[34],"functions.":[36],"The":[37,131],"problem":[38],"suffers":[39],"from":[40],"exponential":[41],"space":[42],"time":[44],"complexities;":[45],"therefore,":[46],"some":[47],"form":[48],"abstraction":[50],"desirable.":[52],"This":[53],"paper":[54,132],"introduces":[55],"new":[57],"concept":[58],"implicit":[60],"state":[61,65,115],"enumeration":[62],"finite":[64],"machines":[66],"(FSMs)":[67],"performed":[68],"at":[69],"word-level.":[71],"Using":[72],"algebraic":[73],"geometry,":[74],"we":[75],"show":[76],"state-space":[79],"circuit":[83,155],"can":[84,125],"be":[85,126],"encoded,":[86],"canonically,":[87],"as":[88],"zeros":[90],"word-level":[93,110,138],"polynomial":[94],"F":[95],"(S)":[96],"over":[97,150],"Galois":[99],"field":[100],"F2k,":[101],"where":[102],"S":[103],"=":[104],"{s0,":[105],"...,":[106],"sk-1}":[107],"representation":[111],"k-bit":[114],"register.":[116],"Subsequently,":[117],"concepts":[118],"elimination":[120],"ideals":[121],"Grobner":[123],"bases":[124],"employed":[127],"FSM":[129,139],"traversal.":[130],"describes":[133],"complete":[135],"theory":[136],"traversal":[140],"demonstrates":[142],"feasibility":[144],"approach":[147],"with":[148],"experiments":[149],"set":[152],"benchmarks.":[156]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}