Definition Moves of the PDA Languages of the PDA Deterministic PDA’s

Definitions Equivalence to Finite Automata

Formalism Derivations Backus-Naur Form Left- and Rightmost Derivations

南京大学：《形式语言与自动机 Formal Languages and Automata》课程教学资源（PPT课件讲稿）Finite Automata

南京大学：《软件安全 Software Security》课程教学资源（PPT课件讲稿）Byzantine Generals Problem

南京大学：《软件安全 Software Security》课程教学资源（PPT课件讲稿）Use-after-free

• Pin Tool ➢ Introduction ➢ Instrumentation granularity ➢ Trace instrumentation ➢ Example ➢ Other important features • Dynamic Taint Analysis ➢ Introduction ➢ Classify of taint analysis ➢ Taint procedure ➢ Taint analysis for security

I. Program Analysis II. Data Flow Analysis ✓ Available Expressions ✓ Liveness Analysis ✓ Reaching Definitions ✓ Very Busy Expressions III.Theory Behind IV. Sensitivity V. Summary

• Static Program Representation ➢ Control Flow Graph ➢ Program Dependence Graph ➢ Points-to Graph ➢ Call Graph • Control Flow Graph Extraction ➢ Source Code to CFG ➢ ELF/PE File to CFG • Applications ➢ Control Flow Integrity – Principles and Implementations(CFI) ➢ Practical Control Flow Integrity & Randomization for Binary Executables(CCFIR) • Summary

南京大学：《软件安全 Software Security》课程教学资源（PPT课件讲稿）Return-Orinted Programming（ROP Attack）