Loop Rerolling for Hardware Decompilation

Author:

Sisco Zachary D.1ORCID,Balkind Jonathan1ORCID,Sherwood Timothy1ORCID,Hardekopf Ben1ORCID

Affiliation:

1. University of California at Santa Barbara, USA

Abstract

We introduce the new problem of hardware decompilation . Analogous to software decompilation, hardware decompilation is about analyzing a low-level artifact—in this case a netlist , i.e., a graph of wires and logical gates representing a digital circuit—in order to recover higher-level programming abstractions, and using those abstractions to generate code written in a hardware description language (HDL). The overall problem of hardware decompilation requires a number of pieces. In this paper we focus on one specific piece of the puzzle: a technique we call hardware loop rerolling . Hardware loop rerolling leverages clone detection and program synthesis techniques to identify repeated logic in netlists (such as would be synthesized from loops in the original HDL code) and reroll them into syntactic loops in the recovered HDL code. We evaluate hardware loop rerolling for hardware decompilation over a set of hardware design benchmarks written in the PyRTL HDL and industry standard SystemVerilog. Our implementation identifies and rerolls loops in 52 out of 53 of the netlists in our benchmark suite, and we show three examples of how hardware decompilation can provide concrete benefits: transpilation between HDLs, faster simulation times over netlists (with mean speedup of 6x), and artifact compaction (39% smaller on average).

Funder

NSF

Publisher

Association for Computing Machinery (ACM)

Subject

Safety, Risk, Reliability and Quality,Software

Reference47 articles.

1. Armaiti Ardeshiricham , Yoshiki Takashima , Sicun Gao , and Ryan Kastner . 2019 . VeriSketch: Synthesizing Secure Hardware Designs with Timing-Sensitive Information Flow Properties . In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security (CCS ’19) . Association for Computing Machinery, New York, NY, USA. 1623–1638. isbn:9781450367479 https://doi.org/10.1145/33 19535.3354246 10.1145/3319535.3354246 10.1145/3319535.3354246 Armaiti Ardeshiricham, Yoshiki Takashima, Sicun Gao, and Ryan Kastner. 2019. VeriSketch: Synthesizing Secure Hardware Designs with Timing-Sensitive Information Flow Properties. In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security (CCS ’19). Association for Computing Machinery, New York, NY, USA. 1623–1638. isbn:9781450367479 https://doi.org/10.1145/3319535.3354246 10.1145/3319535.3354246

2. B. Baker . 1995 . On finding duplication and near-duplication in large software systems . Proceedings of 2nd Working Conference on Reverse Engineering, 86–95 . https://doi.org/10.1109/WCRE.1995.514697 10.1109/WCRE.1995.514697 10.1109/WCRE.1995.514697 B. Baker. 1995. On finding duplication and near-duplication in large software systems. Proceedings of 2nd Working Conference on Reverse Engineering, 86–95. https://doi.org/10.1109/WCRE.1995.514697 10.1109/WCRE.1995.514697

3. A Case for Accelerating Software RTL Simulation

4. A. Becker , D. Novo , and P. Ienne . 2014. SKETCHILOG: Sketching combinational circuits. In 2014 Design , Automation Test in Europe Conference Exhibition (DATE). 1–4. https://doi.org/10 .7873/DATE. 2014 .165 10.7873/DATE.2014.165 10.7873/DATE.2014.165 A. Becker, D. Novo, and P. Ienne. 2014. SKETCHILOG: Sketching combinational circuits. In 2014 Design, Automation Test in Europe Conference Exhibition (DATE). 1–4. https://doi.org/10.7873/DATE.2014.165 10.7873/DATE.2014.165

5. Berkeley logic interchange format (BLIF);Berkeley UC;Oct Tools Distribution,1992

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Programming-by-Demonstration for Long-Horizon Robot Tasks;Proceedings of the ACM on Programming Languages;2024-01-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3