Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/wiley/decompilation-of-binary-programs-6Aj0hqb6Ff
References (27)
-
D. Knuth, R. Floyd (1971)
Notes on Avoiding "go to" StatementsInf. Process. Lett., 1
-
M. Williams (1977)
Generating Structured Flow Diagrams: The Nature of UnstructurednessComput. J., 20
-
D. Workman (1979)
Language Design Using Decompilation. -
A. Aho, J. Ullman (1972)
The Theory of Parsing, Translation, and Compiling -
C. Cifuentes (1993)
A Structuring Algorithm for Decompilation -
M. Emmerik (1994)
Signatures for Library Functions in Executable Files -
C. Cifuentes (1994)
Reverse compilation techniques -
(1991)
Decompilation techniques', Internal to ESPRIT REDO project no. 2487 2487- TN-PRG-1065 Version 1 -
Peter Breuer, Jonathan Bowen (1994)
Decompilation: the enumeration of types and grammarsACM Trans. Program. Lang. Syst., 16
-
Donald Brinkley (1981)
Intercomputer Transportation of Assembly Language Software through Decompilation. -
Barron Housel (1973)
A study of decompiling machine languages into high-level machine independent languages -
C. Cifuentes (1996)
Interprocedural data flow decompilationJ. Program. Lang., 4
-
L. Ramshaw (1988)
Eliminating go to's while preserving program structureJ. ACM, 35
-
F. Friedman (1974)
Decompilation and the transfer of mini-computer operating systems. -
B. Baker (1977)
An Algorithm for Structuring FlowgraphsJournal of the ACM (JACM), 24
-
(1988)
URL: ftp//cs.washington.edu/ pub/decomp.tar.z -
(1988)
and R -
P. Lewis (1974)
B74-17 The Theory of Parsing, Translation, and Compiling - Volume II: CompilingIEEE Trans. Computers, 23
-
R. Templeton (1983)
‘Public domain’ software, 35
-
C. Fischer, R. Cytron, R. LeBlanc (1988)
Crafting a Compiler -
D. Pavey, L. Winsborrow (1993)
Demonstrating Equivalence of Source Code and PROM ContentsComput. J., 36
-
C. Cifuentes (1996)
Structuring Decompiled Graphs -
Ana Erosa, L. Hendren (1994)
Taming control flow: a structured approach to eliminating goto statementsProceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94)
-
C. Cifuentes, K. Gough (1993)
A Methodology for Decompilation -
J. Larus, T. Ball (1994)
Rewriting executable files to measure program behaviorSoftware: Practice and Experience, 24
-
A. Baker, S. Zweben (1979)
A Comparison of Measures of Control Flow ComplexityIEEE Transactions on Software Engineering, SE-6
-
M. Williams, G. Chen (1985)
Restructuring Pascal Programs Containing Goto StatementsComput. J., 28
- Publisher
- Wiley
- Copyright
- Copyright © 1995 Wiley Subscription Services, Inc., A Wiley Company
- ISSN
- 0038-0644
- eISSN
- 1097-024X
- DOI
- 10.1002/spe.4380250706
- Publisher site
- See Article on Publisher Site
Abstract
The structure of a decompiler is presented, along with a thorough description of the different modules that form part of a decompiler, and the type of analyses that are performed on the machine code to regenerate high‐level language code. The phases of the decompiler have been grouped into three main modules: front‐end, universal decompiling machine, and back‐end. The front‐end is a machine‐dependent module that performs the loading, parsing and semantic analysis of the input program, as well as generating an intermediate representation of the program. The universal decompiling machine is a machine‐ and language‐independent module that performs data and control flow analysis of the program based on the intermediate representation, and the program's control flow graph. The back‐end is a language‐dependent module that deals with the details of the target high‐level language.
Journal
Software: Practice and Experience – Wiley
Published: Jul 1, 1995
Keywords: ; ; ; ; ;