Abstract

. We describe a system which decompiles (reverse engineers) C programs from target machine code by type-inference techniques. This extends recent trends in the converse process of compiling high-level languages whereby type information is preserved during compilation. The algorithms remain independent of the particular architecture by virtue of treating target instructions as register-transfer specications. Target code expressed in such RTL form is then transformed into SSA form (undoing register colouring etc.); this then generates a set of type constraints. Iteration and recursion over data-structures causes synthesis of appropriate recursive C structs; this is triggered by and resolves occurscheck constraint violation. Other constraint violations are resolved by C's casts and unions. In the limit we use heuristics to select between equally suitable C code|a good GUI would clearly facilitate its professional use. 1 Introduction Over the last forty years there has been much work on ...

Citations

749	Efficiently computing static single assignment form and the control dependence graph - Cytron, Ferrante, et al. - 1991
557	From system F to typed assembly language - Morrisett, Walker, et al. - 1999
245	The Design and Implementation of a Certifying Compiler - Necula, Lee - 2004
50	Reverse Compilation Techniques - Cifuentes - 1994
27	Eciently computing static single assignment form and the control dependence graph - Cytron, Ferrante, et al. - 1991
8	Using Informal and Formal Techniques for Reverse Engineering of C Programs - Gannod, Cheng - 1996
3	Correcting errors in the curry system - Gandhe, Venkatesh, et al. - 1996
2	A Theory of Polymorphism - Milner - 1978
2	Eect systems with subtyping - Tang, Jouvelot - 1995
1	An 80x86 to C Reverse Compiler. Diploma in - Glasscock - 1998
1	BCPL|The Language and its Compiler, CUP - Richards, Whitby-Strevens - 1979