Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Binary translation using peephole translation rules

Patent ·
OSTI ID:1176279

An efficient binary translator uses peephole translation rules to directly translate executable code from one instruction set to another. In a preferred embodiment, the translation rules are generated using superoptimization techniques that enable the translator to automatically learn translation rules for translating code from the source to target instruction set architecture.

Research Organization:
Stanford Univ., CA (United States)
Sponsoring Organization:
USDOE
DOE Contract Number:
W-7405-ENG-48
Assignee:
The Board of Trustees of the Leland Stanford Junior University (Palo Alto, CA)
Patent Number(s):
7,712,092
Application Number:
12/069,755
OSTI ID:
1176279
Country of Publication:
United States
Language:
English

References (7)

Denali: a goal-directed superoptimizer
  • Joshi, Rajeev; Nelson, Greg; Randall, Keith
  • Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation - PLDI '02 https://doi.org/10.1145/512529.512566
conference January 2002
Automatic generation of peephole optimizations journal June 1984
Superoptimizer: a look at the smallest program journal October 1987
The design of a resourceable and retargetable binary translator conference January 1999
Automatic generation of fast optimizing code generators journal July 1988
Binary translation and architecture convergence issues for IBM system/390 conference January 2000
Automatic generation of peephole superoptimizers
  • Bansal, Sorav; Aiken, Alex
  • Proceedings of the 12th international conference on Architectural support for programming languages and operating systems - ASPLOS-XII https://doi.org/10.1145/1168857.1168906
conference January 2006