{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T05:32:32Z","timestamp":1767850352349,"version":"3.49.0"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T00:00:00Z","timestamp":1656288000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Fraunhofer High Performance Center Secure Intelligent Systems"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2022,11,30]]},"abstract":"<jats:p>The target of sequential reverse engineering is to extract the state machine of a design. Sequential reverse engineering of a gate-level netlist consists of the identification of so-called state flip-flops (sFFs), as well as the extraction of the state machine. The second step can be solved with an exact approach if the correct sFFs and the correct reset state are provided. For the first step, several more or less heuristic approaches exist.<\/jats:p>\n          <jats:p>This work investigates sequential reverse engineering with the objective of a human-readable state machine extraction. A human-readable state machine reflects the original state machine and is not overloaded by additional design information. For this purpose, the work derives a systematic categorization of sFF sets, based on properties of single sFFs and their sets. These properties are determined by analyzing the degrees of freedom in describing state machines as the well-known Moore and Mealy machines. Based on the systematic categorization, this work presents an sFF set definition for a human-readable state machine, categorizes existing sFF identification strategies, and develops four post-processing methods. The results show that post-processing predominantly improves the outcome of several existing sFF identification algorithms.<\/jats:p>","DOI":"10.1145\/3513086","type":"journal-article","created":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T19:50:50Z","timestamp":1645213850000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Toward a Human-Readable State Machine Extraction"],"prefix":"10.1145","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7341-9812","authenticated-orcid":false,"given":"Michaela","family":"Brunner","sequence":"first","affiliation":[{"name":"Technical University of Munich, Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Hepp","sequence":"additional","affiliation":[{"name":"Technical University of Munich, Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johanna","family":"Baehr","sequence":"additional","affiliation":[{"name":"Technical University of Munich, Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Sigl","sequence":"additional","affiliation":[{"name":"Technical University of Munich and Fraunhofer Institute for Applied and Integrated Security, Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,6,27]]},"reference":[{"key":"e_1_3_8_2_2","doi-asserted-by":"publisher","DOI":"10.13154\/tches.v2020.i4.309-336"},{"key":"e_1_3_8_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/43.67784"},{"key":"e_1_3_8_4_2","doi-asserted-by":"crossref","unstructured":"Mathieu Bastian Sebastien Heymann and Mathieu Jacomy. 2009. Gephi: An open source software for exploring and manipulating networks. In Proceedings of the 3rd International Conference on Weblogs and Social Media (ICWSM\u201909) . http:\/\/www.aaai.org\/ocs\/index.php\/ICWSM\/09\/paper\/view\/154.","DOI":"10.1609\/icwsm.v3i1.13937"},{"key":"e_1_3_8_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2019.8740844"},{"key":"e_1_3_8_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/54.867894"},{"key":"e_1_3_8_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1988.122482"},{"key":"e_1_3_8_8_2","doi-asserted-by":"publisher","DOI":"10.13154\/tches.v2018.i3.293-330"},{"key":"e_1_3_8_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18072.2020.9218616"},{"key":"e_1_3_8_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(60)90744-0"},{"key":"e_1_3_8_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2013.6581568"},{"key":"e_1_3_8_12_2","unstructured":"Kenneth S. McElvain. 2001. Methods and apparatuses for automatic extraction of finite state machines. US Patent No. US 6 182 268 B1 filed January 5 1998 issued January 30 2001."},{"key":"e_1_3_8_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2016.7527495"},{"key":"e_1_3_8_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/3287624.3288739"},{"key":"e_1_3_8_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/s41635-018-0043-4"},{"key":"e_1_3_8_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2016.7428086"},{"key":"e_1_3_8_17_2","doi-asserted-by":"crossref","unstructured":"Travis Meade Shaojie Zhang and Yier Jin. 2019. NetA. Retrieved February 28 2022 from https:\/\/github.com\/jinyier\/NetA.","DOI":"10.1145\/3287624.3288739"},{"key":"e_1_3_8_18_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1955.tb03788.x"},{"key":"e_1_3_8_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/277044.277235"},{"key":"e_1_3_8_20_2","first-page":"129","article-title":"Gedanken-experiments on sequential machines","volume":"34","author":"Moore Edward F.","year":"1956","unstructured":"Edward F. Moore. 1956. Gedanken-experiments on sequential machines. Automata Studies 34 (1956), 129\u2013153.","journal-title":"Automata Studies"},{"key":"e_1_3_8_21_2","unstructured":"Oklahoma State University. 2015. Flows\/FreePDK45. Retrieved February 28 2022 from https:\/\/vlsiarch.ecen.okstate.edu\/flow\/."},{"key":"e_1_3_8_22_2","unstructured":"OnchipUIS. 2017. mriscv. Retrieved February 28 2022 from https:\/\/github.com\/onchipuis\/mriscv."},{"key":"e_1_3_8_23_2","unstructured":"OnchipUIS. 2017. mriscvcore. Retrieved February 28 2022 from https:\/\/github.com\/onchipuis\/mriscvcore."},{"key":"e_1_3_8_24_2","unstructured":"Opencircuitdesign. 2019. qflow. Retrieved February 28 2022 from http:\/\/opencircuitdesign.com\/qflow\/."},{"key":"e_1_3_8_25_1","unstructured":"OpenCores. n.d. OpenCores. Retrieved February 28 2022 from https:\/\/opencores.org\/projects."},{"key":"e_1_3_8_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/2755563"},{"key":"e_1_3_8_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2010.5537093"},{"key":"e_1_3_8_28_2","unstructured":"Joachim Str\u00f6mbergson. 2018. secworks. Retrieved February 28 2022 from https:\/\/github.com\/secworks?tab=repositories."},{"key":"e_1_3_8_29_2","doi-asserted-by":"publisher","DOI":"10.7873\/DATE.2013.264"},{"key":"e_1_3_8_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1971.10"},{"key":"e_1_3_8_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/2024724.2024805"},{"key":"e_1_3_8_32_1","unstructured":"Clifford Wolf. n.d. Yosys Open SYnthesis Suite. Retrieved February 28 2022 from https:\/\/yosyshq.net\/yosys\/."}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3513086","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3513086","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:20Z","timestamp":1750188680000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3513086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,27]]},"references-count":31,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,11,30]]}},"alternative-id":["10.1145\/3513086"],"URL":"https:\/\/doi.org\/10.1145\/3513086","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"value":"1084-4309","type":"print"},{"value":"1557-7309","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,27]]},"assertion":[{"value":"2021-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-06-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}