Binary translation using peephole translation rules
Abstract
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.
- Inventors:
- Issue Date:
- Research Org.:
- Stanford Univ., CA (United States)
- Sponsoring Org.:
- USDOE
- OSTI Identifier:
- 1176279
- Patent Number(s):
- 7712092
- Application Number:
- 12/069,755
- Assignee:
- The Board of Trustees of the Leland Stanford Junior University (Palo Alto, CA)
- Patent Classifications (CPCs):
-
G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING
- DOE Contract Number:
- W-7405-ENG-48
- Resource Type:
- Patent
- Resource Relation:
- Patent File Date: 2008 Feb 12
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 97 MATHEMATICS AND COMPUTING
Citation Formats
Bansal, Sorav, and Aiken, Alex. Binary translation using peephole translation rules. United States: N. p., 2010.
Web.
Bansal, Sorav, & Aiken, Alex. Binary translation using peephole translation rules. United States.
Bansal, Sorav, and Aiken, Alex. Tue .
"Binary translation using peephole translation rules". United States. https://www.osti.gov/servlets/purl/1176279.
@article{osti_1176279,
title = {Binary translation using peephole translation rules},
author = {Bansal, Sorav and Aiken, Alex},
abstractNote = {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.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Tue May 04 00:00:00 EDT 2010},
month = {Tue May 04 00:00:00 EDT 2010}
}
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.
Works referenced in this record:
Denali: a goal-directed superoptimizer
conference, January 2002
- Joshi, Rajeev; Nelson, Greg; Randall, Keith
- Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation - PLDI '02
Automatic generation of fast optimizing code generators
journal, July 1988
- Fraser, C. W.; Wendt, A. L.
- ACM SIGPLAN Notices, Vol. 23, Issue 7
The design of a resourceable and retargetable binary translator
conference, January 1999
- Cifuentes, C.; Van Emmerik, M.; Ramsey, N.
- Sixth Working Conference on Reverse Engineering (Cat. No.PR00303)
Automatic generation of peephole optimizations
journal, June 1984
- Davidson, Jack W.; Fraser, Christopher W.
- ACM SIGPLAN Notices, Vol. 19, Issue 6
Superoptimizer: a look at the smallest program
journal, October 1987
- Massalin, Henry
- ACM SIGOPS Operating Systems Review, Vol. 21, Issue 4
Automatic generation of peephole superoptimizers
conference, January 2006
- Bansal, Sorav; Aiken, Alex
- Proceedings of the 12th international conference on Architectural support for programming languages and operating systems - ASPLOS-XII
Binary translation and architecture convergence issues for IBM system/390
conference, January 2000
- Gschwind, Michael; Ebcioğlu, Kemal; Altman, Erik
- Proceedings of the 14th international conference on Supercomputing - ICS '00