JEREMY FETIVEAU ATTACKING TURBOFAN
|
|
|
- Amanda Clarke
- 6 years ago
- Views:
Transcription
1 JEREMY FETIVEAU ATTACKING TURBOFAN TyphoonCon Seoul
2 INTRODUCTION 2 WHO AM I? digital nomad* independent security research I contribute to doar-e.github.io Open to x86 doar-e.github.io * french, as you can tell from my accent ;-)
3 INTRODUCTION 3 WHAT IS THIS TALK ABOUT? Google Chrome V8 javascript engine TurboFan optimizing compiler
4 SUMMARY 4 SUMMARY Internals Typer bugs Incorrect assumptions on maps Exploitation
5 INTERNALS 5
6 INTERNALS 6 BUILTINS Predefined Array.prototype.concat Several kind CPP Code Stub Assembler Torque Pre-optimized code in cache
7 INTERNALS 7 MEMORY REPRESENTATION d8> let a = new Array(1,2,3,4) d8> %DebugPrint(a) DebugPrint: [JSArray] - map: <Map(PACKED_SMI_ELEMENTS)> [FastProperties] - prototype: <JSArray[0]> - elements: <FixedArray[4]> [PACKED_SMI_ELEMENTS] - length: 4 - properties: <FixedArray[0]> { #length } - elements: <FixedArray[4]> { 0: 1 1: 2 2: 3 3: 4 }
8 INTERNALS 8 MEMORY REPRESENTATION d8> let a = new Array(1,2,3,4) d8> %DebugPrint(a) DebugPrint: [JSArray] - map: <Map(PACKED_SMI_ELEMENTS)> [FastProperties] - prototype: <JSArray[0]> - elements: <FixedArray[4]> [PACKED_SMI_ELEMENTS] - length: 4 - properties: <FixedArray[0]> { #length } - elements: <FixedArray[4]> { 0: 1 1: 2 2: 3 3: 4 } The map describes the object structure. Also known as : Hidden class Type (chakra) Structure (JavaScriptCore) Shape (SpiderMonkey)
9 INTERNALS 9 MEMORY REPRESENTATION d8> let a = new Array(1,2,3,4) d8> %DebugPrint(a) DebugPrint: [JSArray] - map: <Map(PACKED_SMI_ELEMENTS)> [FastProperties] - prototype: <JSArray[0]> - elements: <FixedArray[4]> [PACKED_SMI_ELEMENTS] - length: 4 - properties: <FixedArray[0]> { #length } - elements: <FixedArray[4]> { 0: 1 1: 2 2: 3 3: 4 } The map describes the object structure. Also known as : Hidden class Type (chakra) Structure (JavaScriptCore) Shape (SpiderMonkey) The ElementsKinds tells us about the types of elements.
10 INTERNALS 10 MEMORY REPRESENTATION JSArray ElementsKind [1,2,3] PACKED_SMI_ELEMENTS [1,,,,,,2,3] HOLEY_SMI_ELEMENTS [1.1,1.2] PACKED_DOUBLE_ELEMENTS [{},1.1,2] PACKED_ELEMENTS
11 INTERNALS 11 TURBOFAN, IGNITION, LIFTOFF TurboFan builtins (pre-optimized) Ignition bytecode for JavaScript Optimized later by TurboFan WebAssembly code Uses the Liftoff base compiler
12 INTERNALS 12 SPECULATIVE OPTIMIZATIONS move(player) move(player)... move(player)
13 INTERNALS 13 SPECULATIVE OPTIMIZATIONS move(player) move(player)... move(player)... move(wall) DEOPTIMIZATION
14 INTERNALS 14 IGNITION BYTECODE let inc = (obj) => (obj.x + 1) StackCheck LdaNamedProperty a0, [0], [1] AddSmi [1], [0] Constant pool (size = 1) - length: 1 0: <String[#1]: x> Return
15 INTERNALS 15 SHAPES
16 INTERNALS 16 INLINE CACHES Inline caching is remembering the result of a previous similar lookup.
17 INTERNALS 17 INLINE CACHES
18 INTERNALS - SEA OF NODES 18 A SEA OF NODES Control-flow edges Data-flow edges Effect-flow edges
19 INTERNALS - SEA OF NODES 19 CONTROL EDGES CONDITION TRUE BRANCH FALSE BRANCH
20 INTERNALS - SEA OF NODES 20 VALUE EDGES 42 VARIABLE X ADD
21 INTERNALS - SEA OF NODES 21 EFFECT EDGES What happens if LOAD FIELD No control dependency No value dependency STORE FIELD Effect edges order operations reading and writing states
22 INTERNALS 22 TURBOFAN S PIPELINE Optimisations phases Reducers Work on nodes We can observe that with a tool called Turbolizer d8 file.js --trace-turbo tools/turbolizer/ src/compiler/pipeline.cc
23 INTERNALS 23 OPTIMIZATIONS Classical optimizations in reducers Strength reduction Constant folding Type and range analysis Typed lowering
24 INTERNALS 24 REDUCTIONS- STRENGTH REDUCTION Recommended reading : TurboFan JIT Design, Ben Titzer
25 INTERNALS 25 TYPED LOWERING Recommended reading : TurboFan JIT Design, Ben Titzer
26 INTERNALS 26 TYPED LOWERING Note : You need a typer Recommended reading : TurboFan JIT Design, Ben Titzer
27 INTERNALS 27 RANGE ANALYSIS Recommended reading : TurboFan JIT Design, Ben Titzer
28 INTERNALS 28 RANGE ANALYSIS Recommended reading : TurboFan JIT Design, Ben Titzer
29 INTERNALS 29 TURBOLIZER - BYTECODE GRAPH BUILDER VS TYPER PHASE
30 INTERNALS 30 TURBOLIZER - TYPING A PHI NODE
31 31
32 INTERNALS 32 CHECKMAPS
33 33
34 INTERNALS 34 EXAMPLE 1 - MONOMORPHIC INLINE CACHE var obj1 = { x : 1 }; var obj2 = { x : 2 }; var obj3 = { x : 3, y : 4 }; inc(obj1); inc(obj2); %OptimizeFunctionOnNextCall(inc); - slot #1 LoadProperty MONOMORPHIC { [1]: [weak] 0x a5e9 <Map(HOLEY_ELEMENTS)> [2]: 836 }
35 INTERNALS 35 EXAMPLE 1 - MONOMORPHIC INLINE CACHE var obj1 = { x : 1 }; var obj2 = { x : 2 }; var obj3 = { x : 3, y : 4 }; inc(obj1); inc(obj2); %OptimizeFunctionOnNextCall(inc); inc(obj3); CHECKMAPS BAILS OUT TO DEOPTIMIZATION!
36 INTERNALS 36 EXAMPLE 1 - MONOMORPHIC INLINE CACHE
37 INTERNALS 37 EXAMPLE 1 - MONOMORPHIC INLINE CACHE $ d8 add.js --trace-deopt [deoptimizing (DEOPT eager): begin 0x3554bc6dfa41 <JSFunction inc (sfi = 0x3554bc6df6e1)> (opt FP to SP delta: 24, caller sp: 0x7ffee3bbced0] ;;; deoptimize at <add.js:2:11>, wrong map reading input frame inc => bytecode_offset=0, args=2, height=1, retval=0(#0); inputs: 0: 0x3554bc6dfa41 ; [fp - 16] 0x3554bc6dfa41 <JSFunction inc (sfi = 0x3554bc6df6e1)> 1: 0x35541eb01599 ; [fp + 24] 0x35541eb01599 <JSGlobal Object> 2: 0x35541eb0bba1 ; rdx 0x35541eb0bba1 <Object map = 0x3554ad30a689> 3: 0x3554bc6c1851 ; [fp - 24] 0x3554bc6c1851 <NativeContext[249]> 4: 0x35543d1c0e19 ; (literal 2) 0x35543d1c0e19 <Odd Oddball: optimized_out> translating interpreted frame inc => bytecode_offset=0, height=8 0x7ffee3bbcec8: [top + 64] <- 0x35541eb01599 <JSGlobal Object> ; stack parameter (input #1) 0x7ffee3bbcec0: [top + 56] <- 0x35541eb0bba1 <Object map = 0x3554ad30a689> ; stack parameter (input #2) x7ffee3bbceb8: [top + 48] <- 0x00010c94e6a4 ; caller's pc 0x7ffee3bbceb0: [top + 40] <- 0x7ffee3bbcf10 ; caller's fp 0x7ffee3bbcea8: [top + 32] <- 0x3554bc6c1851 <NativeContext[249]> ; context (input #3) 0x7ffee3bbcea0: [top + 24] <- 0x3554bc6dfa41 <JSFunction inc (sfi = 0x3554bc6df6e1)> ; function (input #0) 0x7ffee3bbce98: [top + 16] <- 0x3554bc6dfbd9 <BytecodeArray[9]> ; bytecode array 0x7ffee3bbce90: [top + 8] <- 0x <Smi 53> ; bytecode offset x7ffee3bbce88: [top + 0] <- 0x35543d1c0e19 <Odd Oddball: optimized_out> ; accumulator (input #4) [deoptimizing (eager): end 0x3554bc6dfa41 <JSFunction inc (sfi = => node=0, pc=0x00010c94ea80, caller sp=0x7ffee3bbced0, took ms]
38 INTERNALS 38 EXAMPLE 2 - POLYMORPHIC INLINE CACHE var obj1 = { x : 1 }; var obj2 = { x : 2 }; var obj3 = { x : 3, y : 4 }; inc(obj1); inc(obj2); inc(obj3); %OptimizeFunctionOnNextCall(inc); inc(obj3); - slot #1 LoadProperty POLYMORPHIC { [1]: 0x209f8b14bc69 <Other heap object (WEAK_FIXED_ARRAY_TYPE)> [2]: 0x209f62284a39 <Symbol: (uninitialized_symbol)> }
39 INTERNALS 39 EXAMPLE 2 - POLYMORPHIC INLINE CACHE
40 TYPER BUGS 40
41 TYPER BUGS 41 OVERVIEW Typer Operation Typer Type cache
42 TYPER BUGS 42 STRING LAST INDEX Bug found by tsuro Type::Range(-1.0, String::kMaxLength - 1, t->zone()); Type::Range(-1.0, String::kMaxLength, t->zone());
43 TYPER BUGS 43 EXPM1 - TYPER - OPERATION TYPER Bug found by tsuro, Nice write-ups by Andrea Biondo and Jay Bosamiya Present in both typer and operation typer Typer for JSCall to builtin Math.expm1 Operation typer for nodes Expm1
44 TYPER BUGS 44 EXPM1 - TYPER - OPERATION TYPER Type::Union(Type::PlainNumber(), Type::NaN(), t->zone()) Type::Number() d8> Object.is(-0, Math.expm1(-0)) true
45 TYPER BUGS 45 A LATTICE OF TYPES - WHAT IS A LATTICE? Top Bottom
46 TYPER BUGS 46 A LATTICE OF TYPES Top MinusZero is not included in : - PlainNumber - NaN Bottom
47 TYPER BUGS 47 A LATTICE OF TYPES Top MinusZero is included in Number Bottom
48 TYPER BUGS 48 SPEAKING OF WHICH - WHAT ABOUT TOP AND BOTTOM? Top is Type::Any Type::Any maybe any type Bottom is Type::None Type::None is any type
49 TYPER BUGS 49 SPEAKING OF WHICH - WHAT ABOUT TOP AND BOTTOM? none_type.is(type::foo()) TAUTOLOGY! Typer::Visitor::ComparisonOutcome Typer::Visitor::NumberCompareTyper(Type lhs, Type rhs, Typer* t) { DCHECK(lhs.Is(Type::Number())); DCHECK(rhs.Is(Type::Number())); // if (lhs.isnone() rhs.isnone()) return {}; // Shortcut for NaNs. if (lhs.is(type::nan()) rhs.is(type::nan())) return kcomparisonundefined;
50 TYPER BUGS 50 SPEAKING OF WHICH - WHAT ABOUT TOP AND BOTTOM? none_type.is(type::foo()) TAUTOLOGY! Type Typer::Visitor::JSEqualTyper(Type lhs, Type rhs, Typer* t) { // if (lhs.isnone() rhs.isnone()) return Type::None(); if (lhs.is(type::nan()) rhs.is(type::nan())) return t->singleton_false_; // [ ] }
51 TYPER BUGS 51 SPEAKING OF WHICH - WHAT ABOUT TOP AND BOTTOM? any_type.maybe(type::foo()) TAUTOLOGY! Type Typer::Visitor::JSAddTyper(Type lhs, Type rhs, Typer* t) { lhs = ToPrimitive(lhs, t); rhs = ToPrimitive(rhs, t); OsrValues are typed as Any if (lhs.maybe(type::string()) rhs.maybe(type::string())) { if (lhs.is(type::string()) rhs.is(type::string())) { return Type::String(); } else { return Type::NumericOrString(); } }
52 TYPER BUGS 52 SPECULATIVE SAFE INTEGER SUBTRACTIONS / ADDITIONS Bug found by Jay Bosamiya
53 TYPER BUGS 53 SPECULATIVE SAFE INTEGER SUBTRACTIONS / ADDITIONS Bug found by Jay Bosamiya Type::Intersect(result, cache_.ksafeinteger, zone()) Type::Intersect(result, cache_.ksafeintegerorminuszero, zone())
54 TYPER BUGS 54 NUMBER MAX/MIN
55 TYPER BUGS 55 ASIDE Other places impacted by incorrect handling of -0 Incorrect truncation of null in representation change -0 == null (false) truncated to -0 == 0 (true) Inexistent representation of MinusZero Float64 representation Tagged representation
56 TYPER BUGS 56 PROMISE CATCH / FINALLY
57 TYPER BUGS 57 CHROME TIANFU CUP
58 TYPER BUGS 58 CHROME TIANFU CUP TypeCache : type of ArgumentsLength nodes Type::Range(0.0, Code::kMaxArguments, zone()) CreateRange(0.0, FixedArray::kMaxLength)
59 TYPER BUGS 59 CHROME TIANFU CUP static const int kmaxarguments = (1 << kargumentsbits) - 2; static const int kargumentsbits = 16; kmaxarguments = (1 << 16) - 2 = 0x
60 TYPER BUGS 60 CHROME TIANFU CUP TurboFan type cache for ArgumentsLength nodes (1 << 16) - 2 What if we use a spread operator in an array to pass arguments? array.length = (1 << 16) funct( array) TURBOFAN ACTUAL EXECUTION (1 << 16) - 2 (1 << 16)
61 TYPER BUGS 61 CHROME TIANFU CUP let fun = () => { let x = arguments.length; a = new Array(0x10) a[0] = 1.1; a[(x >> 16) * 0x10] = 42.42; } TURBOFAN a[0] ACTUAL EXECUTION a[0x10]
62 EXPLOITATION 62
63 EXPLOITATION 63 TYPER BUGS - ABUSING BCE Incorrect typing Propagated to other reductions What about BCE during simplified lowering phase?
64 EXPLOITATION 64 BCE - SIMPLIFIED LOWERING if ((index_type.min() >= 0.0 && )) index_type.max() < length_type.min() DeferReplacement(node, node->inputat(0));
65 EXPLOITATION 65 BCE REMOVED - ABORTING BOUND CHECKS
66 EXPLOITATION 66 BCE REMOVED - ABORTING BOUND CHECKS if ((index_type.min() >= 0.0 && )) index_type.max() < length_type.min() mode = CheckBoundsParameters::kAbortOnOutOfBounds;
67 EXPLOITATION 67 LOAD_IGNORE_OUT_OF_BOUNDS CheckBounds(index, Smi::kMaxValue) + NumberLessThan(index, length) What if we propagate a bad typing to NumberLessThan?
68 EXPLOITATION 68 TYPE NARROWING, CONSTANT FOLDING AND DEAD CODE ELIMINATION Type narrowing reducer NumberLessThan : can be typed as true or false Constant folding reducer A node typed as true or false will be replaced by a HeapConstant Dead code elimination reducer Will remove the branch that is believed not to be taken TLDR : bound checks have been optimised out
69 69 MAPS, ELEMENTS KIND AND EFFECT CHAINS* * I was lacking inspiration for this title :-)
70 WRONG ASSUMPTIONS ON MAPS 70 JSCALL REDUCER AND UNRELIABLE MAPS Recent blogpost by tsuro from Project Zero
71 WRONG ASSUMPTIONS ON MAPS 71 FIXING BY ADDING A CHECKMAPS JSCall reducer of ArrayIndexOf / ArrayIncludes during inlining phase
72 WRONG ASSUMPTIONS ON MAPS INFERRING THE RECEIVER MAPS
73 WRONG ASSUMPTIONS ON MAPS COMPUTING THE ELEMENTS KIND
74 WRONG ASSUMPTIONS ON MAPS USING THE ELEMENTS KIND
75 WRONG ASSUMPTIONS ON MAPS 75 BUT HOW DO WE INFER THE RECEIVER MAPS? Walks up the effect chain Search for information concerning the map of the receiver 3 possible outcomes 1. No map information has been found 2. Receiver maps can be fully trusted 3. Receiver maps may have changed
76 WRONG ASSUMPTIONS ON MAPS 76 THE EFFECT CHAIN
77 77
78 78 kreliablereceivermaps
79 79 kreliablereceivermaps
80 80 kunreliablereceivermaps
81 81 kunreliablereceivermaps
82 82 kunreliablereceivermaps
83 83 kunreliablereceivermaps
84 84 WE INFER THE RECEIVER MAPS FROM THIS NODE kunreliablereceivermaps
85 85 map A side effect side effect may have transitioned from map A
86 Forgotten CheckMaps 86
87 WRONG ASSUMPTIONS ON MAPS 87 THE REDUCER NEVER CHECKS FOR UNRELIABLE MAPS 1. Infer receiver maps by walking up the effect chain 1. If the set is empty : do nothing 2. Forget to check if the set is unreliable 1. Map informations may not be true anymore because of side effects 2. Compute the union of all the elements kinds of the receiver maps 3. Create nodes assuming this (potentially incorrect) elements kind
88 WRONG ASSUMPTIONS ON MAPS 88 JSCALL REDUCER AND INCORRECT ELEMENTS KIND Blogpost by István Kurucsai from Exodus Intelligence
89 WRONG ASSUMPTIONS ON MAPS 89 FIXING BY DEOPTIMIZING WHEN THE ARRAY CONTAINS DICTIONARY ELEMENTS
90 WRONG ASSUMPTIONS ON MAPS 90 INFERRING RECEIVER MAPS AND ELEMENTS KIND
91 WRONG ASSUMPTIONS ON MAPS 91 OBSERVE THE CORRECT HANDLING OF UNRELIABLE RECEIVER MAPS
92 WRONG ASSUMPTIONS ON MAPS 92 BUT THIS CAN CHANGE THE ELEMENTS KIND
93 WRONG ASSUMPTIONS ON MAPS 93 THE ELEMENTS KIND MAY HAVE CHANGED 1. Infer the receiver maps 2. Compute the ElementsKind from it 3. Make a new CreateArray node 1. Can change the ElementsKind 4. Inline the rest of code, assuming a specific (incorrect) ElementsKind
94 WRONG ASSUMPTIONS ON MAPS 94 HOW ARE THOSE BUGS INTERESTING? ElementsKind confusion PACKED vs DICTIONARY
95 WRONG ASSUMPTIONS ON MAPS 95 REMEMBER THIS? How does TurboFan knows that JSCall has side effects? Because it is not knowrite!
96 WRONG ASSUMPTIONS ON MAPS 96 CREATEOBJECT Bug found by 5aelo Awesome phrack article CreateObject knowrite (means side effect free ) But actually does have side effects
97 WRONG ASSUMPTIONS ON MAPS 97 HOW IS THIS INTERESTING Same primitive : ElementsKind confusion 1. Check map A of object O 2. Trigger a side effect with CreateObject so that O.map goes from A to A1 3. Forget to check map A (and thus deoptimize because of type A1) 4. Use object O as if it was of map A while it is actually A1
98 WRONG ASSUMPTIONS ON MAPS 98 MISSING KILLMAPS IN LOAD ELIMINATION Bug found by lokihardt What does killing maps means? Killing maps of an object means removing all the knowledge about an object s maps
99 WRONG ASSUMPTIONS ON MAPS 99 MISSING KILLMAPS IN LOAD ELIMINATIION
100 WRONG ASSUMPTIONS ON MAPS 100 MISSING KILLMAPS IN LOAD ELIMINATIION
101 WRONG ASSUMPTIONS ON MAPS 101 HOW IS THIS INTERESTING Unexpected transition Again, ElementsKind confusion
102 EXPLOITATION 102
103 EXPLOITATION 103 ELEMENTS KIND CONFUSION Dictionary vs packed Packed double vs Packed elements Mis-interpret a float as a (tagged) object pointer
104 EXPLOITATION 104 THE OBJECTIVE - CONTROL AN ARRAY BUFFER Corrupt / fake an ArrayBuffer Underlying memory is fully controlled Length Backing store pointer
105 EXPLOITATION 105 HOW? OOB R on PACKED_ELEMENTS Leak data Leak object pointers Leak backing store pointer of an ArrayBuffer Get a fake object Read a float as an object
106 EXPLOITATION 106 HOW? OOB W with PACKED_SMI_ELEMENTS Place an array with PACKED_DOUBLE_ELEMENTS after the object Modify its length OOB W with the PACKED_DOUBLE_ELEMENTS Modify an ArrayBuffer Or corrupt a PACKED_ELEMENTS array and read a pointer to a crafted object
107 EXPLOITATION 107 CODE EXECUTION FROM ARBITRARY WRITE JSFunction used to contain a pointer to RWX code You can still get a pointer to RWX memory with a WASM module!
108 EXPLOITATION 108 RWX MEMORY FROM WASM d8> load("sample_wasm.js") d8> %DumpObjects(global_test,10) [ JS_FUNCTION_TYPE : 0x38 ] x00002fac7911ed10 0x ebc84191 MAP_TYPE 0x00002fac7911ed18 0x00000cdfc0080c19 FIXED_ARRAY_TYPE 0x00002fac7911ed20 0x00000cdfc0080c19 FIXED_ARRAY_TYPE 0x00002fac7911ed28 0x00002fac7911ecd9 SHARED_FUNCTION_INFO_TYPE 0x00002fac7911ed30 0x00002fac NATIVE_CONTEXT_TYPE 0x00002fac7911ed38 0x00000d1caca00691 FEEDBACK_CELL_TYPE 0x00002fac7911ed40 0x00002dc28a CODE_TYPE
109 EXPLOITATION 109 RWX MEMORY FROM WASM d8> %DumpObjects(0x00002fac7911ecd9,11) [ SHARED_FUNCTION_INFO_TYPE : 0x38 ] x00002fac7911ecd8 0x00000cdfc MAP_TYPE 0x00002fac7911ece0 0x00002fac7911ecb1 WASM_EXPORTED_FUNCTION_DATA_TYPE 0x00002fac7911ece8 0x00000cdfc00842c1 ONE_BYTE_INTERNALIZED_STRING_TYPE 0x00002fac7911ecf0 0x00000cdfc0082ad1 FEEDBACK_METADATA_TYPE 0x00002fac7911ecf8 0x00000cdfc00804c9 ODDBALL_TYPE 0x00002fac7911ed00 0x f 0x00002fac7911ed08 0x ff00
110 EXPLOITATION 110 RWX MEMORY FROM WASM d8> %DumpObjects(0x00002fac7911ecb1,11) [ WASM_EXPORTED_FUNCTION_DATA_TYPE : 0x28 ] x00002fac7911ecb0 0x00000cdfc00857a9 MAP_TYPE 0x00002fac7911ecb8 0x00002dc28a CODE_TYPE 0x00002fac7911ecc0 0x00002fac7911eb29 WASM_INSTANCE_TYPE 0x00002fac7911ecc8 0x x00002fac7911ecd0 0x
111 EXPLOITATION 111 RWX MEMORY FROM WASM d8> %DumpObjects(0x00002fac7911eb29,41) [ WASM_INSTANCE_TYPE : 0x118 : REFERENCES RWX MEMORY] 0x00002fac7911ec20 0x e7c50a000 JumpTableStart [RWX]
112 112
113 CONCLUSION 113 TurboFan is a very interesting target Bug classes are quite specific to JIT engines Shout-out to Axel 0vercl0k Souchet, Bruno Keith and Georgi Geshev Special thanks to Noam & Ido from SSD for the opportunity to speak Kudos to the V8 team for their amazing work
114 THANK x86 doar-e.github.io
Stack Allocation. Run-Time Data Structures. Static Structures
Run-Time Data Structures Stack Allocation Static Structures For static structures, a fixed address is used throughout execution. This is the oldest and simplest memory organization. In current compilers,
The V8 JavaScript Engine
The V8 JavaScript Engine Design, Implementation, Testing and Benchmarking Mads Ager, Software Engineer Agenda Part 1: What is JavaScript? Part 2: V8 internals Part 3: V8 testing and benchmarking What is
Chapter 7D The Java Virtual Machine
This sub chapter discusses another architecture, that of the JVM (Java Virtual Machine). In general, a VM (Virtual Machine) is a hypothetical machine (implemented in either hardware or software) that directly
Chapter 5 Names, Bindings, Type Checking, and Scopes
Chapter 5 Names, Bindings, Type Checking, and Scopes Chapter 5 Topics Introduction Names Variables The Concept of Binding Type Checking Strong Typing Scope Scope and Lifetime Referencing Environments Named
Bypassing Browser Memory Protections in Windows Vista
Bypassing Browser Memory Protections in Windows Vista Mark Dowd & Alexander Sotirov [email protected] [email protected] Setting back browser security by 10 years Part I: Introduction Thesis Introduction
Bypassing Memory Protections: The Future of Exploitation
Bypassing Memory Protections: The Future of Exploitation Alexander Sotirov [email protected] About me Exploit development since 1999 Research into reliable exploitation techniques: Heap Feng Shui in JavaScript
Habanero Extreme Scale Software Research Project
Habanero Extreme Scale Software Research Project Comp215: Java Method Dispatch Zoran Budimlić (Rice University) Always remember that you are absolutely unique. Just like everyone else. - Margaret Mead
A JIT Compiler for Android s Dalvik VM. Ben Cheng, Bill Buzbee May 2010
A JIT Compiler for Android s Dalvik VM Ben Cheng, Bill Buzbee May 2010 Overview View live session notes and ask questions on Google Wave: http://bit.ly/bizjnf Dalvik Environment Trace vs. Method Granularity
Tachyon: a Meta-circular Optimizing JavaScript Virtual Machine
Tachyon: a Meta-circular Optimizing JavaScript Virtual Machine Maxime Chevalier-Boisvert Erick Lavoie Marc Feeley Bruno Dufour {chevalma, lavoeric, feeley, dufour}@iro.umontreal.ca DIRO - Université de
Object Oriented Software Design II
Object Oriented Software Design II Introduction to C++ Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa February 20, 2012 G. Lipari (Scuola Superiore Sant Anna) C++ Intro February
Solution: start more than one instruction in the same clock cycle CPI < 1 (or IPC > 1, Instructions per Cycle) Two approaches:
Multiple-Issue Processors Pipelining can achieve CPI close to 1 Mechanisms for handling hazards Static or dynamic scheduling Static or dynamic branch handling Increase in transistor counts (Moore s Law):
Organization of Programming Languages CS320/520N. Lecture 05. Razvan C. Bunescu School of Electrical Engineering and Computer Science bunescu@ohio.
Organization of Programming Languages CS320/520N Razvan C. Bunescu School of Electrical Engineering and Computer Science [email protected] Names, Bindings, and Scopes A name is a symbolic identifier used
Instruction Set Architecture (ISA)
Instruction Set Architecture (ISA) * Instruction set architecture of a machine fills the semantic gap between the user and the machine. * ISA serves as the starting point for the design of a new machine
Open-source Versus Commercial Software: A Quantitative Comparison
Open-source Versus Commercial Software: A Quantitative Comparison Rix Groenboom Reasoning NL BV [email protected] Agenda About Reasoning The Study Inspection Results Analysis Conclusions New
An Object Storage Model for the Truffle Language Implementation Framework
An Object Storage Model for the Truffle Language Implementation Framework Andreas Wöß Christian Wirth Daniele Bonetta Chris Seaton Christian Humer Hanspeter Mössenböck Institute for System Software, Johannes
Static Analysis. Find the Bug! 15-654: Analysis of Software Artifacts. Jonathan Aldrich. disable interrupts. ERROR: returning with interrupts disabled
Static Analysis 15-654: Analysis of Software Artifacts Jonathan Aldrich 1 Find the Bug! Source: Engler et al., Checking System Rules Using System-Specific, Programmer-Written Compiler Extensions, OSDI
CS412/CS413. Introduction to Compilers Tim Teitelbaum. Lecture 20: Stack Frames 7 March 08
CS412/CS413 Introduction to Compilers Tim Teitelbaum Lecture 20: Stack Frames 7 March 08 CS 412/413 Spring 2008 Introduction to Compilers 1 Where We Are Source code if (b == 0) a = b; Low-level IR code
I Control Your Code Attack Vectors Through the Eyes of Software-based Fault Isolation. Mathias Payer, ETH Zurich
I Control Your Code Attack Vectors Through the Eyes of Software-based Fault Isolation Mathias Payer, ETH Zurich Motivation Applications often vulnerable to security exploits Solution: restrict application
A Static Analyzer for Large Safety-Critical Software. Considered Programs and Semantics. Automatic Program Verification by Abstract Interpretation
PLDI 03 A Static Analyzer for Large Safety-Critical Software B. Blanchet, P. Cousot, R. Cousot, J. Feret L. Mauborgne, A. Miné, D. Monniaux,. Rival CNRS École normale supérieure École polytechnique Paris
First Java Programs. V. Paúl Pauca. CSC 111D Fall, 2015. Department of Computer Science Wake Forest University. Introduction to Computer Science
First Java Programs V. Paúl Pauca Department of Computer Science Wake Forest University CSC 111D Fall, 2015 Hello World revisited / 8/23/15 The f i r s t o b l i g a t o r y Java program @author Paul Pauca
Fast JavaScript in V8. The V8 JavaScript Engine. ...well almost all boats. Never use with. Never use with part 2.
Fast JavaScript in V8 Erik Corry Google The V8 JavaScript Engine A from-scratch reimplementation of the ECMAScript 3 language An Open Source project from Google, primarily developed here in Århus A real
Platform-independent static binary code analysis using a metaassembly
Platform-independent static binary code analysis using a metaassembly language Thomas Dullien, Sebastian Porst zynamics GmbH CanSecWest 2009 Overview The REIL Language Abstract Interpretation MonoREIL
LINKED DATA STRUCTURES
LINKED DATA STRUCTURES 1 Linked Lists A linked list is a structure in which objects refer to the same kind of object, and where: the objects, called nodes, are linked in a linear sequence. we keep a reference
Semantic Analysis: Types and Type Checking
Semantic Analysis Semantic Analysis: Types and Type Checking CS 471 October 10, 2007 Source code Lexical Analysis tokens Syntactic Analysis AST Semantic Analysis AST Intermediate Code Gen lexical errors
Numerical Matrix Analysis
Numerical Matrix Analysis Lecture Notes #10 Conditioning and / Peter Blomgren, [email protected] Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research
Format string exploitation on windows Using Immunity Debugger / Python. By Abysssec Inc WwW.Abysssec.Com
Format string exploitation on windows Using Immunity Debugger / Python By Abysssec Inc WwW.Abysssec.Com For real beneficiary this post you should have few assembly knowledge and you should know about classic
language 1 (source) compiler language 2 (target) Figure 1: Compiling a program
CS 2112 Lecture 27 Interpreters, compilers, and the Java Virtual Machine 1 May 2012 Lecturer: Andrew Myers 1 Interpreters vs. compilers There are two strategies for obtaining runnable code from a program
Comp 411 Principles of Programming Languages Lecture 34 Semantics of OO Languages. Corky Cartwright Swarat Chaudhuri November 30, 20111
Comp 411 Principles of Programming Languages Lecture 34 Semantics of OO Languages Corky Cartwright Swarat Chaudhuri November 30, 20111 Overview I In OO languages, data values (except for designated non-oo
1 The Java Virtual Machine
1 The Java Virtual Machine About the Spec Format This document describes the Java virtual machine and the instruction set. In this introduction, each component of the machine is briefly described. This
picojava TM : A Hardware Implementation of the Java Virtual Machine
picojava TM : A Hardware Implementation of the Java Virtual Machine Marc Tremblay and Michael O Connor Sun Microelectronics Slide 1 The Java picojava Synergy Java s origins lie in improving the consumer
Data Structure with C
Subject: Data Structure with C Topic : Tree Tree A tree is a set of nodes that either:is empty or has a designated node, called the root, from which hierarchically descend zero or more subtrees, which
How to Write a Checker in 24 Hours
How to Write a Checker in 24 Hours Clang Static Analyzer Anna Zaks and Jordan Rose Apple Inc. What is this talk about? The Clang Static Analyzer is a bug finding tool It can be extended with custom checkers
Stack machines The MIPS assembly language A simple source language Stack-machine implementation of the simple language Readings: 9.1-9.
Code Generation I Stack machines The MIPS assembly language A simple source language Stack-machine implementation of the simple language Readings: 9.1-9.7 Stack Machines A simple evaluation model No variables
Scoping (Readings 7.1,7.4,7.6) Parameter passing methods (7.5) Building symbol tables (7.6)
Semantic Analysis Scoping (Readings 7.1,7.4,7.6) Static Dynamic Parameter passing methods (7.5) Building symbol tables (7.6) How to use them to find multiply-declared and undeclared variables Type checking
Instruction Set Architecture. or How to talk to computers if you aren t in Star Trek
Instruction Set Architecture or How to talk to computers if you aren t in Star Trek The Instruction Set Architecture Application Compiler Instr. Set Proc. Operating System I/O system Instruction Set Architecture
COMP 356 Programming Language Structures Notes for Chapter 10 of Concepts of Programming Languages Implementing Subprograms.
COMP 356 Programming Language Structures Notes for Chapter 10 of Concepts of Programming Languages Implementing Subprograms 1 Activation Records activation declaration location Recall that an activation
Operator Overloading. Lecture 8. Operator Overloading. Running Example: Complex Numbers. Syntax. What can be overloaded. Syntax -- First Example
Operator Overloading Lecture 8 Operator Overloading C++ feature that allows implementer-defined classes to specify class-specific function for operators Benefits allows classes to provide natural semantics
Informatica e Sistemi in Tempo Reale
Informatica e Sistemi in Tempo Reale Introduction to C programming Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa October 25, 2010 G. Lipari (Scuola Superiore Sant Anna)
Embedded Programming in C/C++: Lesson-1: Programming Elements and Programming in C
Embedded Programming in C/C++: Lesson-1: Programming Elements and Programming in C 1 An essential part of any embedded system design Programming 2 Programming in Assembly or HLL Processor and memory-sensitive
Persistent Binary Search Trees
Persistent Binary Search Trees Datastructures, UvA. May 30, 2008 0440949, Andreas van Cranenburgh Abstract A persistent binary tree allows access to all previous versions of the tree. This paper presents
University of Twente. A simulation of the Java Virtual Machine using graph grammars
University of Twente Department of Computer Science A simulation of the Java Virtual Machine using graph grammars Master of Science thesis M. R. Arends, November 2003 A simulation of the Java Virtual Machine
AUTOMATED TEST GENERATION FOR SOFTWARE COMPONENTS
TKK Reports in Information and Computer Science Espoo 2009 TKK-ICS-R26 AUTOMATED TEST GENERATION FOR SOFTWARE COMPONENTS Kari Kähkönen ABTEKNILLINEN KORKEAKOULU TEKNISKA HÖGSKOLAN HELSINKI UNIVERSITY OF
TypeScript for C# developers. Making JavaScript manageable
TypeScript for C# developers Making JavaScript manageable Agenda What is TypeScript OO in TypeScript Closure Generics Iterators Asynchronous programming Modularisation Debugging TypeScript 2 What is TypeScript
Hotpatching and the Rise of Third-Party Patches
Hotpatching and the Rise of Third-Party Patches Alexander Sotirov [email protected] BlackHat USA 2006 Overview In the next one hour, we will cover: Third-party security patches _ recent developments
How Safe does my Code Need to be? Shawn A. Prestridge, Senior Field Applications Engineer
How Safe does my Code Need to be? Shawn A. Prestridge, Senior Field Applications Engineer Agendum What the benefits of Functional Safety are What the most popular safety certifications are Why you should
Program Analysis for JavaScript Challenges and Techniques
Program Analysis for JavaScript Challenges and Techniques Anders Møller Center for Advanced Software Analysis Aarhus University Joint work with Esben Andreasen, Simon Holm Jensen, Peter A. Jonsson, Magnus
EMSCRIPTEN - COMPILING LLVM BITCODE TO JAVASCRIPT (?!)
EMSCRIPTEN - COMPILING LLVM BITCODE TO JAVASCRIPT (?!) ALON ZAKAI (MOZILLA) @kripken JavaScript..? At the LLVM developer's conference..? Everything compiles into LLVM bitcode The web is everywhere, and
Programming by Contract. Programming by Contract: Motivation. Programming by Contract: Preconditions and Postconditions
COMP209 Object Oriented Programming Designing Classes 2 Mark Hall Programming by Contract (adapted from slides by Mark Utting) Preconditions Postconditions Class invariants Programming by Contract An agreement
UIL Computer Science for Dummies by Jake Warren and works from Mr. Fleming
UIL Computer Science for Dummies by Jake Warren and works from Mr. Fleming 1 2 Foreword First of all, this book isn t really for dummies. I wrote it for myself and other kids who are on the team. Everything
Obfuscation: know your enemy
Obfuscation: know your enemy Ninon EYROLLES [email protected] Serge GUELTON [email protected] Prelude Prelude Plan 1 Introduction What is obfuscation? 2 Control flow obfuscation 3 Data flow
The C Programming Language course syllabus associate level
TECHNOLOGIES The C Programming Language course syllabus associate level Course description The course fully covers the basics of programming in the C programming language and demonstrates fundamental programming
JavaScript as a compilation target Making it fast
JavaScript as a compilation target Making it fast Florian Loitsch, Google Who am I? Florian Loitsch, software engineer at Google Projects Scheme2Js - Scheme-to-JavaScript compiler Js2scheme - JavaScript-to-Scheme
We will learn the Python programming language. Why? Because it is easy to learn and many people write programs in Python so we can share.
LING115 Lecture Note Session #4 Python (1) 1. Introduction As we have seen in previous sessions, we can use Linux shell commands to do simple text processing. We now know, for example, how to count words.
Tutorial on C Language Programming
Tutorial on C Language Programming Teodor Rus [email protected] The University of Iowa, Department of Computer Science Introduction to System Software p.1/64 Tutorial on C programming C program structure:
An overview of FAT12
An overview of FAT12 The File Allocation Table (FAT) is a table stored on a hard disk or floppy disk that indicates the status and location of all data clusters that are on the disk. The File Allocation
Crash Course in Java
Crash Course in Java Based on notes from D. Hollinger Based in part on notes from J.J. Johns also: Java in a Nutshell Java Network Programming and Distributed Computing Netprog 2002 Java Intro 1 What is
KITES TECHNOLOGY COURSE MODULE (C, C++, DS)
KITES TECHNOLOGY 360 Degree Solution www.kitestechnology.com/academy.php [email protected] [email protected] Contact: - 8961334776 9433759247 9830639522.NET JAVA WEB DESIGN PHP SQL, PL/SQL
Pitfalls of Object Oriented Programming
Sony Computer Entertainment Europe Research & Development Division Pitfalls of Object Oriented Programming Tony Albrecht Technical Consultant Developer Services A quick look at Object Oriented (OO) programming
A binary search tree or BST is a binary tree that is either empty or in which the data element of each node has a key, and:
Binary Search Trees 1 The general binary tree shown in the previous chapter is not terribly useful in practice. The chief use of binary trees is for providing rapid access to data (indexing, if you will)
Semester Review. CSC 301, Fall 2015
Semester Review CSC 301, Fall 2015 Programming Language Classes There are many different programming language classes, but four classes or paradigms stand out:! Imperative Languages! assignment and iteration!
Abstract Data Type. EECS 281: Data Structures and Algorithms. The Foundation: Data Structures and Abstract Data Types
EECS 281: Data Structures and Algorithms The Foundation: Data Structures and Abstract Data Types Computer science is the science of abstraction. Abstract Data Type Abstraction of a data structure on that
Software security. Buffer overflow attacks SQL injections. Lecture 11 EIT060 Computer Security
Software security Buffer overflow attacks SQL injections Lecture 11 EIT060 Computer Security Buffer overflow attacks Buffer overrun is another common term Definition A condition at an interface under which
Advanced Computer Architecture-CS501. Computer Systems Design and Architecture 2.1, 2.2, 3.2
Lecture Handout Computer Architecture Lecture No. 2 Reading Material Vincent P. Heuring&Harry F. Jordan Chapter 2,Chapter3 Computer Systems Design and Architecture 2.1, 2.2, 3.2 Summary 1) A taxonomy of
More on Pipelining and Pipelines in Real Machines CS 333 Fall 2006 Main Ideas Data Hazards RAW WAR WAW More pipeline stall reduction techniques Branch prediction» static» dynamic bimodal branch prediction
Caml Virtual Machine File & data formats Document version: 1.4 http://cadmium.x9c.fr
Caml Virtual Machine File & data formats Document version: 1.4 http://cadmium.x9c.fr Copyright c 2007-2010 Xavier Clerc [email protected] Released under the LGPL version 3 February 6, 2010 Abstract: This
ERNW Newsletter 51 / September 2015
ERNW Newsletter 51 / September 2015 Playing With Fire: Attacking the FireEye MPS Date: 9/10/2015 Classification: Author(s): Public Felix Wilhelm TABLE OF CONTENT 1 MALWARE PROTECTION SYSTEM... 4 2 GAINING
Concepts and terminology in the Simula Programming Language
Concepts and terminology in the Simula Programming Language An introduction for new readers of Simula literature Stein Krogdahl Department of Informatics University of Oslo, Norway April 2010 Introduction
CVE-2012-1535 Adobe Flash Player Integer Overflow Vulnerability Analysis
Your texte here. CVE-2012-1535 Adobe Flash Player Integer Overflow Vulnerability Analysis October 11 th, 2012 Brian MARIANI & Frédéric BOURLA A FEW WORDS ABOUT FLASH PLAYER Your Adobe texte Flash here
Eclipse Visualization and Performance Monitoring
Eclipse Visualization and Performance Monitoring Chris Laffra IBM Ottawa Labs http://eclipsefaq.org/chris Chris Laffra Eclipse Visualization and Performance Monitoring Page 1 Roadmap Introduction Introspection
Upcompiling Legacy Code to Java
Master Thesis Upcompiling Legacy Code to Java Author Urs Fässler Supervisor ETH Zürich UC Irvine Prof. Dr. Thomas Gross Prof. Dr. Michael Franz Dr. Stefan Brunthaler Dr. Per Larsen September 7, 2012 Urs
DATA STRUCTURES USING C
DATA STRUCTURES USING C QUESTION BANK UNIT I 1. Define data. 2. Define Entity. 3. Define information. 4. Define Array. 5. Define data structure. 6. Give any two applications of data structures. 7. Give
Variable Base Interface
Chapter 6 Variable Base Interface 6.1 Introduction Finite element codes has been changed a lot during the evolution of the Finite Element Method, In its early times, finite element applications were developed
Object Oriented Software Design
Object Oriented Software Design Introduction to Java - II Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa October 28, 2010 G. Lipari (Scuola Superiore Sant Anna) Introduction
Auditing a Web Application. Brad Ruppert. SANS Technology Institute GWAS Presentation 1
Auditing a Web Application Brad Ruppert SANS Technology Institute GWAS Presentation 1 Objectives Define why application vulnerabilities exist Address Auditing Approach Discuss Information Interfaces Walk
JetBrains ReSharper 2.0 Overview Introduction ReSharper is undoubtedly the most intelligent add-in to Visual Studio.NET 2003 and 2005. It greatly increases the productivity of C# and ASP.NET developers,
1 Abstract Data Types Information Hiding
1 1 Abstract Data Types Information Hiding 1.1 Data Types Data types are an integral part of every programming language. ANSI-C has int, double and char to name just a few. Programmers are rarely content
esrever gnireenigne tfosorcim seiranib
esrever gnireenigne tfosorcim seiranib Alexander Sotirov [email protected] CanSecWest / core06 Reverse Engineering Microsoft Binaries Alexander Sotirov [email protected] CanSecWest / core06 Overview
6.088 Intro to C/C++ Day 4: Object-oriented programming in C++ Eunsuk Kang and Jean Yang
6.088 Intro to C/C++ Day 4: Object-oriented programming in C++ Eunsuk Kang and Jean Yang Today s topics Why objects? Object-oriented programming (OOP) in C++ classes fields & methods objects representation
Glossary of Object Oriented Terms
Appendix E Glossary of Object Oriented Terms abstract class: A class primarily intended to define an instance, but can not be instantiated without additional methods. abstract data type: An abstraction
Modern Web Development with Dart. Alan Knight Google
Modern Web Development with Dart Alan Knight Google Smalltalk Industry Conference 2013 The Web As an application platform We want... Large, extensible widget set Simple, clean APIs Model/View separation
Write Barrier Removal by Static Analysis
Write Barrier Removal by Static Analysis Karen Zee and Martin Rinard Laboratory for Computer Science Massachusetts Institute of Technology Cambridge, MA 02139 {kkz, [email protected] ABSTRACT We present
GDB Tutorial. A Walkthrough with Examples. CMSC 212 - Spring 2009. Last modified March 22, 2009. GDB Tutorial
A Walkthrough with Examples CMSC 212 - Spring 2009 Last modified March 22, 2009 What is gdb? GNU Debugger A debugger for several languages, including C and C++ It allows you to inspect what the program
Web development... the server side (of the force)
Web development... the server side (of the force) Fabien POULARD Document under license Creative Commons Attribution Share Alike 2.5 http://www.creativecommons.org/learnmore Web development... the server
Google Apps Engine. G-Jacking AppEngine-based applications. Presented 30/05/2014. For HITB 2014 By Nicolas Collignon and Samir Megueddem
Google Apps Engine G-Jacking AppEngine-based applications Presented 30/05/2014 For HITB 2014 By Nicolas Collignon and Samir Megueddem Introduction to GAE G-Jacking The code The infrastructure The sandbox
CS 111 Classes I 1. Software Organization View to this point:
CS 111 Classes I 1 Software Organization View to this point: Data Objects and primitive types Primitive types operators (+, /,,*, %). int, float, double, char, boolean Memory location holds the data Objects
Object Oriented Software Design
Object Oriented Software Design Introduction to Java - II Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa September 14, 2011 G. Lipari (Scuola Superiore Sant Anna) Introduction
Fast and Precise Hybrid Type Inference for JavaScript
Fast and Precise Hybrid Type Inference for JavaScript Brian Hackett Shu-yu Guo Mozilla {bhackett,shu}@mozilla.com Abstract JavaScript performance is often bound by its dynamically typed nature. Compilers
Applying Clang Static Analyzer to Linux Kernel
Applying Clang Static Analyzer to Linux Kernel 2012/6/7 FUJITSU COMPUTER TECHNOLOGIES LIMITED Hiroo MATSUMOTO 管 理 番 号 1154ka1 Copyright 2012 FUJITSU COMPUTER TECHNOLOGIES LIMITED Abstract Now there are
Introduction to Java. CS 3: Computer Programming in Java
Introduction to Java CS 3: Computer Programming in Java Objectives Begin with primitive data types Create a main class with helper methods Learn how to call built-in class methods and instance methods
Practical Online Filesystem Checking and Repair
Practical Online Filesystem Checking and Repair Daniel Phillips Samsung Research America (Silicon Valley) [email protected] 1 2013 SAMSUNG Electronics Co. Why we want online checking: Fsck
Memory management. Announcements. Safe user input. Function pointers. Uses of function pointers. Function pointer example
Announcements Memory management Assignment 2 posted, due Friday Do two of the three problems Assignment 1 graded see grades on CMS Lecture 7 CS 113 Spring 2008 2 Safe user input If you use scanf(), include
Interpreters and virtual machines. Interpreters. Interpreters. Why interpreters? Tree-based interpreters. Text-based interpreters
Interpreters and virtual machines Michel Schinz 2007 03 23 Interpreters Interpreters Why interpreters? An interpreter is a program that executes another program, represented as some kind of data-structure.
Data Structure Reverse Engineering
Data Structure Reverse Engineering Digging for Data Structures Polymorphic Software with DSLR Scott Hand October 28 th, 2011 Outline 1 Digging for Data Structures Motivations Introduction Laika Details
Testing, Debugging, and Verification
Testing, Debugging, and Verification Testing, Part II Moa Johansson 10 November 2014 TDV: Testing /GU 141110 1 / 42 Admin Make sure you are registered for the course. Otherwise your marks cannot be recorded.
CIS570 Modern Programming Language Implementation. Office hours: TDB 605 Levine [email protected]. [email protected].
CIS570 Modern Programming Language Implementation Instructor: Admin. Assistant: URL: E Christopher Lewis Office hours: TDB 605 Levine [email protected] Cheryl Hickey [email protected] 502
Translating C code to MIPS
Translating C code to MIPS why do it C is relatively simple, close to the machine C can act as pseudocode for assembler program gives some insight into what compiler needs to do what's under the hood do
Virtual Machine Learning: Thinking Like a Computer Architect
Virtual Machine Learning: Thinking Like a Computer Architect Michael Hind IBM T.J. Watson Research Center March 21, 2005 CGO 05 Keynote 2005 IBM Corporation What is this talk about? Virtual Machines? 2
