PDF-Runtime organizationImprovements to stack machine code generationOur c

1 When to perform optimizations Machine independent Too high levelOn assembly language Exposes optimization opportunities Machine dependent Must reimplement optimizations when retargettingOn an. -- Basic functions. Generally, an independent course, maybe plus one semester on implementation of a compiler.. High level language program .  program in assembly language or object code directly. Computer Systems. Lecture 13: Exploits and. E. xploit Prevention. Basic Program Exploitation. Protecting the Stack. Advanced Program Exploitation. Defenses Against ROP. Kernel Exploits and Rootkits. 2. Ben Livshits. Based in part of Stanford class slides from . http://www.stanford.edu/class/cs295. /. and slides from Ben Zorn’s talk slides. My Lectures. Lecture 1. : . Introduction to . static. . Submitted by. Adnan. . Hassoneh. Asad. . Alsebaee. Ayoub. . Qadoos. Mutasem. . Essa. Abed . Alqader. . Salameh. Supervised. by. Dr. Salameh. . Abd. . Alfattah. INTRODUCTION.. LATHE MACHINE.. CNC MACHINE.. Translators and Compilers. . Dr. Chuck Lillie. Course Outline. Translators and Compilers. Language Processors. Compilation. Syntactic Analysis. Contextual Analysis. Run-Time Organization. Code Generation. Buffer overflow. Slides adapted from Bryant and . O’Hallaron. Carnegie Mellon. Recall: Memory . Referencing Bug Example. fun(0) ➙ 3.14. fun(1) . ➙. 3.14. fun(2) . ➙. 3.1399998664856. fun(3) . andrew.pardoe@microsoft.com. ). .NET Native (. dotnetnative@microsoft.com. ). Program Manager, .NET Runtime. .NET Native . deep dive. Questions?. .NET code . g. eneration: A primer. Source code. (C#/VB/F#). Buffer overflow. Slides adapted from Bryant and . O’Hallaron. Carnegie Mellon. Recall: Memory . Referencing Bug Example. fun(0) ➙ 3.14. fun(1) . ➙. 3.14. fun(2) . ➙. 3.1399998664856. fun(3) . Operations. Basic Machine Code . Operations. Machine Code. 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 . Represents different voltage levels. High: 5 Volts. Low: . 0. Volts. At this raw level a digital computer is instructed to carry out instructions. . Buffer Overflow Attacks. 1. A buffer on the stack has an un-checked bound.. A malicious input could modify program control flow by overwriting data on the stack, e.g. saved EIP.. Malicious code can be injected on the stack and EIP can be made to point to it.. Advanced Topics. 15-213: Introduction to Computer Systems. 9. th. Lecture, Feb. 9, 2016. Instructors:. . Franz Franchetti & Seth Copen Goldstein, Ralf Brown, and Brian Railing. Today. Memory Layout. …borrowed from D. Spiegel (with modifications). Computer Organizaton. Top_Level. Structure. The von-Neumann Machine. Microprocessors. Machine Architecture Types. Stack Machine. Accumulator Machine. Enabling Programmer-Transparent . Near-Data Processing in GPU Systems. Kevin Hsieh. Eiman. . Ebrahimi. , . Gwangsun. Kim, . Niladrish. Chatterjee, . Mike O’Connor, . Nandita. . Vijaykumar. , . Onur. 1. Microsoft Research . 2. UW-Madison . 3. ETH-Zurich. Arvind. Arasu. 1. Spyros Blanas. 2. Ken Eguro. 1. Donald Kossmann. 3. Ravi Ramamurthy. 1. Venkie. Ramarathnam. 1. Raghav. Kaushik. 1.