Presentation is loading. Please wait.

Presentation is loading. Please wait.

Binary Program Rewriting with Diablo – Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 1 Binary.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Binary Program Rewriting with Diablo – Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 1 Binary."— Presentation transcript:

1 Binary Program Rewriting with Diablo – Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 1 Binary Program Rewriting with Diablo Bjorn De Sutter Ghent University PLDI06, June 06, 2006

2 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 2 Credits Bruno De Bus Dominique Chanet Ludo Van Put Matias Madou Bertrand Anckaert Koen De Bosschere

3 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 3 Overview Some background Diablo –Extensibility –Retargetability –Reliability

4 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 4 Overview INTRODUCTION (45 min) DATASTRUCTURES (1 hr) ANALYSES AND TRANSFORMATIONS (45 min) BACKENDS (30 min)

5 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 5 Program Development Assembly Code Assembly Code compiler Assembly Code Assembly Code Assembly Code Assembly Code Assembly code Assembly code Code 1 Data 1 Meta 1 Code 1 Data 1 Meta 1 Code 1 Data 1 Meta 1 assembler Executable linker Broncode programming Broncode Source code

6 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 6 Linking Linker Data 1 Code 1 Meta 1 Code 2 Data 2 Meta 2 Code 3 Data 3 Meta 3 start print stop Data 1 Code 1 Code 2 Code 3 Data 2 Data 3

7 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 7 Program Development Assembly Code Assembly Code compiler Assembly Code Assembly Code Assembly Code Assembly Code Assembly code Assembly code Code 1 Data 1 Meta 1 Code 1 Data 1 Meta 1 Code 1 Data 1 Meta 1 assembler Executable linker Broncode programming Broncode Source code Compacted Executable Compacted Executable Squeeze++

8 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 8 Exec Additional optimization opportunities? Squeeze++ Exec Meta linker

9 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 9 Code size reduction obtained with optimization and code abstraction mediaintfpC++ Results (Squeeze++) [De Sutter, De Bus and De Bosschere, ACM TOPLAS, Sept 2005]

10 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 10 Exec Problems Squeeze++ Exec Meta linker Only for the Alpha architecture. Only for compaction/optimization Small change implies days of debugging Not retargetable Not extensible Not reliable

11 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 11 Other rewriters? Exec OM Code Data Meta Code Data Meta Code Data Meta Same problems: - not retargetable - not extensible - not reliable

12 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 12 Spike Tru Epoxie Wall92 OM mips Srivastava92 Mahler Wall89 OM alpha Srivastava94 OM ATOM Srivastava94 Spike NT Cohn97 OM's evolution

13 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 13 Alto Squeeze++ Squeeze Plto Ilto NNOT Alto's Evolution

14 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 14 static binary rewriting is useful… Applications - Optimization, compaction - Instrumentation - Obfuscation - Program understanding, visualisation - Debugging -... Problems - Not retargetable - Not extensible - Not reliable but it is a bit problematic…

15 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 15 Overview Some background Diablo –Extensibility –Retargetability –Reliability

16 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 16 Pre-link or post-link? + More meta information = more aggressive transformations - No program overview + More meta information = more aggressive transformations - No program overview Pre-link - Less meta information = more conservative transformations + Whole-program overview - Less meta information = more conservative transformations + Whole-program overview Post-link + More meta information + Whole-program overview - More implementation work + More meta information + Whole-program overview - More implementation work Link - time Exec Diablo Code Data Meta Code Data Meta Code Data Meta Exec

17 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 17 Extensibility – The problem compactor instrumentator obfuscator performance optimizer

18 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 18 Exec Diablo Code Data Meta Code Data Meta Code Data Meta Frontend optimizatio n Frontend optimizatio n Exec Instructions Creates Instructions Schedules Instructions... ROFs Reads object files Links them Writes a program... Analyses liveness constant propagation.... Optimizations dead code elimination inlining.... CFG Creates functions Removes Basic Blocks.... Designed for extensibility Frontend instrumentation Frontend instrumentation

19 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 19 Code Data Meta Code Data Meta Code Data Meta linking Code Data Code Data Code Data Operation at different levels Data disassembly CFG construction Exec Layout; assembling Frontend

20 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 20 Linux kernel specialization frontend Application optimization and compaction frontend Extensibility Diablo kDiablo LCTES'04 LCTES'05 Instrumentation frontend FIT PASTE'04 Interactive binary program editor Lancet PASTE'05 Steganography frontend Stilo ICISC'04 Interactive program obfuscator Loco PEPM'05

21 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 21 Overview Some background Diablo –Extensibility –Retargetability –Reliability

22 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 22 Object formats Linkers Architectures Retargetability - The problem Retargetability

23 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 23 Code Data Meta Code Data Meta Code Data Meta Code Data Code Data Code Data Operation at different levels Data Exec Layout; assembling Frontend linking disassembly CFG construction

24 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 24 Code Data Meta Code Data Meta Code Data Meta linking Code Data Code Data Code Data Retargeting multiple ROF & Linkers Data disassembly CFG construction Exec Layout; assembling Code Data Meta Code Data Meta Code Data Meta Object file backend Linker map & linker script Architecture Backend Layout script & layout code Exe backend

25 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 25 Major implemented backends Diablo Diablo, FIT, kDiablo, Lancet ARM MIPS32 LCTES'04 ESA'04 Diablo, FIT, Stilo, kDiablo, Lancet, Loco x86 Diablo, FIT Alpha Diablo IA64 Europar'04 LCTES'05

26 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 26 Overview Some background Diablo –Extensibility –Retargetability –Reliability

27 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 27 Reliability CFG construction Relocation Data flow analysis Reliability - The Problem Conservative for safety Aggressive, precise enough to be useful

28 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 28 CFG Construction Potential problems: - Indirect control flow transfers - Code that is treated as data - Unrealizable paths (procedures) Solutions: - Use relocation information: identifies computable addresses - Use pattern matching: identifies known address computations - Use knowledge on compiler-generated code Potential problems: - Indirect control flow transfers - Code that is treated as data - Unrealizable paths (procedures) Solutions: - Use relocation information: identifies computable addresses - Use pattern matching: identifies known address computations - Use knowledge on compiler-generated code Potential problems: - Differentiate data from code - Detect self-modifying code - Detect unrewritable code Solutions: - Section information - Symbols annotate data in code (ARM ABI) - Self-modifying code in data: no problem at this point - True self-modifying code: look at system calls and protection Potential problems: - Differentiate data from code - Detect self-modifying code - Detect unrewritable code Solutions: - Section information - Symbols annotate data in code (ARM ABI) - Self-modifying code in data: no problem at this point - True self-modifying code: look at system calls and protection DisassemblingConservatively modelling control flow

29 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 29 Detecting Data 0x0080: 0x34900abc 0x0084: 0x76768890 0x0088: 0xe25437ff 0x008c: 0xc0023499 0x0090: 0x00001234 0x0094: 0x858599bd 0x0098: 0x9912f4d7 0x009c: 0xde8723c4 0x00a0: 0x00000120 0x00a4: 0x0000012c 0x00a8: 0x000000d0 0x00ac: 0x00000248 0x00b0: 0x00000210 0x00b4: 0x6798fedc 0x0080: mov r2, 0x0a0 0x0084: cmp r1, $0 0x0088: jl 0x0b4 0x008c: cmp r1, 5 0x0090: jge 0x0b4 0x0094: add r1, r2, r1 0x0098: ldr r1, [r1] 0x009c: jmp r1 0x00a0: 0x00000120 0x00a4: 0x0000012c 0x00a8: 0x000000d0 0x00ac: 0x00000248 0x00b0: 0x00000210 0x00b4: mov r3, r5 $code $data Solution: add mapping symbols Solution: add mapping symbols

30 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 30 Detecting Control Flow Targets 0x0080: 0x34900abc 0x0084: 0x76768890 0x0088: 0xe25437ff 0x008c: 0xc0023499 0x0090: 0x00001234 0x0094: 0x858599bd 0x0098: 0x9912f4d7 0x009c: 0xde8723c4 0x00a0: 0x00000120 0x00a4: 0x0000012c 0x00a8: 0x000000d0 0x00ac: 0x00000248 0x00b0: 0x00000210 0x00b4: 0x6798fedc 0x0080: mov r2, 0x0a0 0x0084: cmp r1, $0 0x0088: jl 0x0b4 0x008c: cmp r1, 5 0x0090: jge 0x0b4 0x0094: add r1, r2, r1 0x0098: ldr r1, [r1] 0x009c: jmp r1 0x00a0: 0x00000120 0x00a4: 0x0000012c 0x00a8: 0x000000d0 0x00ac: 0x00000248 0x00b0: 0x00000210 0x00b4: mov r3, r5... 0x00d0: add r4, r6, r6... 0x0120: ldr r4, [r5] $code $data Direct control flow: trivial Direct control flow: trivial Indirect control flow: only to code-addresses that are targets of relocations! jmp r1 Problem: what about unrelocated computations on code- addresses?

31 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 31 Control Flow: Pattern Matching 0x0080: 0x34900abc 0x0084: 0x76768890 0x0088: 0xe25437ff 0x008c: 0xc0023499 0x0090: 0x00001234 0x0094: 0x858599bd 0x0098: 0x9912f4d7 0x009c: 0xde8723c4 0x00a0: 0x00000120 0x00a4: 0x0000012c 0x00a8: 0x000000d0 0x00ac: 0x00000248 0x00b0: 0x00000210 0x00b4: 0x6798fedc 0x0080: mov r2, 0x0a0 0x0084: cmp r1, $0 0x0088: jl 0x0b4 0x008c: cmp r1, 5 0x0090: jge 0x0b4 0x0094: add r1, r2, r1 0x0098: ldr r1, [r1] 0x009c: jmp r1 0x00a0: 0x00000120 0x00a4: 0x0000012c 0x00a8: 0x000000d0 0x00ac: 0x00000248 0x00b0: 0x00000210 0x00b4: mov r3, r5... 0x00d0: add r4, r6, r6... 0x0120: ldr r4, [r5] $code $data Use pattern matching to improve accuracy of control flow graph: disallow computations on code-addresses that are not part of a recognized pattern

32 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 32 Pattern Matching: example 0x0080: 0x34900abc 0x0084: 0x76768890 0x0088: 0xe25437ff 0x008c: 0xc0023499 0x0090: 0x00001234 0x0094: 0x858599bd 0x0098: 0x9912f4d7 0x009c: 0xde8723c4 0x00a0: 0x00000120 0x00a4: 0x0000012c 0x00a8: 0x000000d0 0x00ac: 0x00000248 0x00b0: 0x00000210 0x00b4: 0x6798fedc 0x0080: mov r2, 0x0a0 0x0084: cmp r1, $0 0x0088: jl 0x0b4 0x008c: cmp r1, 5 0x0090: jge 0x0b4 0x0094: add r1, r2, r1 0x0098: ldr r1, [r1] 0x009c: jmp r1 0x00a0: 0x00000120 0x00a4: 0x0000012c 0x00a8: 0x000000d0 0x00ac: 0x00000248 0x00b0: 0x00000210 0x00b4: mov r3, r5... 0x00d0: add r4, r6, r6... 0x0120: ldr r4, [r5] $code $data switch statement: lower bounds check upper bounds check switch jump jump table switch statement: lower bounds check upper bounds check switch jump jump table

33 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 33 Pattern Matching: example 2 0x0080: 0x34900abc 0x0084: 0x76768890 0x0088: 0xe25437ff 0x008c: 0xc0023499 0x0090: 0x00001234 0x0094: 0x858599bd 0x0098: 0x9912f4d7 0x009c: 0xde8723c4 0x00a0: 0x00000120 0x00a4: 0x0000012c 0x00a8: 0x000000d0 0x00ac: 0x00000248 0x00b0: 0x00000210 0x00b4: 0x6798fedc 0x0080: mov r2, 0x09c 0x0084: cmp r1, $0 0x0088: jl 0x0b4 0x008c: cmp r1, $5 0x0090: jge 0x0b4 0x0094: add r1, r2, r1 0x0098: jmp r1 0x009c: jmp 0x0120 0x00a0: jmp 0x012c 0x00a4: jmp 0x00d0 0x00a8: jmp 0x0248 0x00ac: jmp 0x0210 0x00b0: nop 0x00b4: mov r3, r5... 0x00d0: add r4, r6, r6... 0x0120: ldr r4, [r5] $code switch statement 2: address table is replaced by a series of direct jumps to the switch cases. unrecognized pattern! switch statement 2: address table is replaced by a series of direct jumps to the switch cases. unrecognized pattern! Solution: add pattern to Diablo

34 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 34 Procedure Calls and Returns Function calls and returns are often just “special” indirect jumps: not recognizing them makes the flow graph much too conservative Solution: use pattern matching to recognize them: - rely on ABI - rely on compiler conventions Function calls and returns are often just “special” indirect jumps: not recognizing them makes the flow graph much too conservative Solution: use pattern matching to recognize them: - rely on ABI - rely on compiler conventions ARM indirect procedure call: mov r14, pc mov pc, r2 ARM procedure return: mov pc, r14 or ldr pc, [r13], #4 or ldmia r13, {r4-r7,r15}!

35 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 35 Reliability CFG construction Relocation Data flow analysis Reliability - The Problem 

36 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 36 Data flow analyses Problem - Difficult to analyse - Necessary to improve precision - Especially for C++-like languages (calls through function pointers) Solution - rely on calling-conventions - use symbol information - use mapping symbols - use source code information - use stack unwind information Problem - Difficult to analyse - Necessary to improve precision - Especially for C++-like languages (calls through function pointers) Solution - rely on calling-conventions - use symbol information - use mapping symbols - use source code information - use stack unwind information Stack analysis

37 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 37 int B(int x) { return x * 2; } int C(int x) { return B(x)*2; } int B(int x) { return x * 2; } int C(int x) { return B(x)*2; } B.c Calling convention adherence extern int B(int x); int A(int x) { return B(x); } extern int B(int x); int A(int x) { return B(x); } A.c B is unknown call to B respects calling conventions B is unknown call to B respects calling conventions C is known but A is unknown B respects calling convention C is known but A is unknown B respects calling convention

38 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 38 static int B(int x) { return x * 2; } int C(int x) { return B(x)*2; } static int B(int x) { return x * 2; } int C(int x) { return B(x)*2; } B.c Calling convention adherence C is known no unknown callers of B B does not need to respect calling convention C is known no unknown callers of B B does not need to respect calling convention

39 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 39 B: shl %ecx, #1 ret B: shl %ecx, #1 ret B.s Calling convention adherence extern int B(int x); int A(int x) { int y; asm(“ movl %ecx, x call B movl y, %ecx "); return y; } extern int B(int x); int A(int x) { int y; asm(“ movl %ecx, x call B movl y, %ecx "); return y; } A.c even though B is global, the programmer has control over all call sites B does not need to adhere to calling conventions even though B is global, the programmer has control over all call sites B does not need to adhere to calling conventions solution: identify assembler code through mapping symbols (for inline assembler) and object file header info solution: identify assembler code through mapping symbols (for inline assembler) and object file header info

40 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 40 Reliability CFG construction Relocation Data flow analysis Reliability - The Problem  

41 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 41 Relocation Problem - How to write a correct program? - How to layout data? - How to update pointers? - How to update addresses? Observation - Most “strange” requirements come from linker manipulations Solution - make relocations expressive - make relocations first class objects - let transformations update relocations - use linker scripts Problem - How to write a correct program? - How to layout data? - How to update pointers? - How to update addresses? Observation - Most “strange” requirements come from linker manipulations Solution - make relocations expressive - make relocations first class objects - let transformations update relocations - use linker scripts Producing binary program again

42 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 42 Overview Some background Diablo –Extensibility –Retargetability –Reliability (no, really now)

43 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 43 Reliability CFG construction Relocation Data flow analysis Reliability - The Real Problem Conservative for safety Aggressive, precise enough to be useful

44 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 44 Reliability CFG construction Reliability - The Real Problem Conservative for safety Aggressive, precise enough to be useful Solution: limit most conservative assumptions to parts of program

45 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 45 Code Data Meta Code Data Meta Code Data Meta Code Data Code Data Code Data Limit imprecision to some parts Data Exec

46 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 46 Code Data Meta Code Data Meta Code Data Meta Code Data Code Data Code Data Limit imprecision to some parts Data Exec Code

47 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 47 What program parts? Sections from object files –only refer to each other via symbols –special code addresses identified by relocations –extend relocations where necessary no relaxation annotate PIC code with relocations if necessary mark data...

48 Binary Program Rewriting with Diablo - Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 48 When/why does this work? Under separate compilation –Partial-separate compilation –Compiler-generated code only, not manually- written assembler Compiler needs to maintain conventions Assembly writers do not know compiler- generated code –Because multiple compiler versions are available Whenever imprecision could become viral, the linker (rewriter) is informed!

Download ppt "Binary Program Rewriting with Diablo – Bjorn De Sutter – 2006-6-11 Engineering Sciences Faculty – Electronics and Information Systems Department p. 1 Binary."

Similar presentations

Context-Sensitive Interprocedural Points-to Analysis in the Presence of Function Pointers Presentation by Patrick Kaleem Justin.

Context-Sensitive Interprocedural Points-to Analysis in the Presence of Function Pointers Presentation by Patrick Kaleem Justin.
ECE 454 Computer Systems Programming Compiler and Optimization (I) Ding Yuan ECE Dept., University of Toronto

ECE 454 Computer Systems Programming Compiler and Optimization (I) Ding Yuan ECE Dept., University of Toronto
MIPS ISA-II: Procedure Calls & Program Assembly. (2) Module Outline Review ISA and understand instruction encodings Arithmetic and Logical Instructions.

MIPS ISA-II: Procedure Calls & Program Assembly. (2) Module Outline Review ISA and understand instruction encodings Arithmetic and Logical Instructions.
10/6: Lecture Topics Procedure call Calling conventions The stack

10/6: Lecture Topics Procedure call Calling conventions The stack
Compiler construction in4020 – lecture 10 Koen Langendoen Delft University of Technology The Netherlands.

Compiler construction in4020 – lecture 10 Koen Langendoen Delft University of Technology The Netherlands.
Wannabe Lecturer Alexandre Joly inst.eecs.berkeley.edu/~cs61c-te

Wannabe Lecturer Alexandre Joly inst.eecs.berkeley.edu/~cs61c-te
CPS3340 COMPUTER ARCHITECTURE Fall Semester, 2013 10/17/2013 Lecture 12: Procedures Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER SCIENCE CENTRAL.

CPS3340 COMPUTER ARCHITECTURE Fall Semester, /17/2013 Lecture 12: Procedures Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER SCIENCE CENTRAL.
Assembler/Linker/Loader Mooly Sagiv html://www.cs.tau.ac.il/~msagiv/courses/wcc11-12.html Chapter 4.3 J. Levine: Linkers & Loaders

Assembler/Linker/Loader Mooly Sagiv html:// Chapter 4.3 J. Levine: Linkers & Loaders
Dec 5, 2007University of Virginia1 Efficient Dynamic Tainting using Multiple Cores Yan Huang University of Virginia Dec. 5 2007.

Dec 5, 2007University of Virginia1 Efficient Dynamic Tainting using Multiple Cores Yan Huang University of Virginia Dec
1 Starting a Program The 4 stages that take a C++ program (or any high-level programming language) and execute it in internal memory are: Compiler - C++

1 Starting a Program The 4 stages that take a C++ program (or any high-level programming language) and execute it in internal memory are: Compiler - C++
Whole-Program Linear-Constant Analysis with Applications to Link-Time Optimization Ludo Van Put – Dominique Chanet – Koen De Bosschere Ghent University.

Whole-Program Linear-Constant Analysis with Applications to Link-Time Optimization Ludo Van Put – Dominique Chanet – Koen De Bosschere Ghent University.
Code Compaction of an Operating System Kernel Haifeng He, John Trimble, Somu Perianayagam, Saumya Debray, Gregory Andrews Computer Science Department.

Code Compaction of an Operating System Kernel Haifeng He, John Trimble, Somu Perianayagam, Saumya Debray, Gregory Andrews Computer Science Department.
Assembly Code Verification Using Model Checking Hao XIAO Singapore University of Technology and Design.

Assembly Code Verification Using Model Checking Hao XIAO Singapore University of Technology and Design.
Assembler/Linker/Loader Mooly Sagiv html://www.cs.tau.ac.il/~msagiv/courses/wcc04.html Chapter 4.3.

Assembler/Linker/Loader Mooly Sagiv html:// Chapter 4.3.
August Code Compaction for UniCore on Link-Time Optimization Platform Zhang Jiyu Compilation Toolchain Group MPRC.

August Code Compaction for UniCore on Link-Time Optimization Platform Zhang Jiyu Compilation Toolchain Group MPRC.
Vertically Integrated Analysis and Transformation for Embedded Software John Regehr University of Utah.

Vertically Integrated Analysis and Transformation for Embedded Software John Regehr University of Utah.
Telescoping Languages: A Compiler Strategy for Implementation of High-Level Domain-Specific Programming Systems Ken Kennedy Rice University.

Telescoping Languages: A Compiler Strategy for Implementation of High-Level Domain-Specific Programming Systems Ken Kennedy Rice University.
Peephole Optimization Final pass over generated code: examine a few consecutive instructions: 2 to 4 See if an obvious replacement is possible: store/load.

Peephole Optimization Final pass over generated code: examine a few consecutive instructions: 2 to 4 See if an obvious replacement is possible: store/load.
Previous finals up on the web page use them as practice problems look at them early.

Previous finals up on the web page use them as practice problems look at them early.
Chapter 11-14, Appendix D C Programs Higher Level languages Compilers C programming Converting C to Machine Code C Compiler for LC-3 Please return breadboards.

Chapter 11-14, Appendix D C Programs Higher Level languages Compilers C programming Converting C to Machine Code C Compiler for LC-3 Please return breadboards.

Similar presentations

Ads by Google