ConceptSystems & CS
Control-flow graphs
Graphs formed by control-flow instructions inducing edges among the basic blocks of a function.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Basic blocks1Branch instructions1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
10- Sandboxing Native Code
- Symbolic Execution
- User-Defined Function Optimizations
- Security and Privacy Risks of Browser Extensions
- Dataflow, Superscalar Execution & Branch Prediction
- VLIW and Systolic Array Architectures
- Chopping Binary Executables: Object File Recovery and Modular Decomposition
- Fail: Jmp Fail (Everything I Got Wrong in RE and Security Research)
- Deobfuscation of a Real World Binary Obfuscator
- Hash All The Things / Get All The Sig(s): Automatic Function Detection for Reverse Engineers
Connections
17The lectures that define it or assume it, and the concepts next to it.
Concepts6
Lectures11
- C to Assembly
- Sandboxing Native Code
- Symbolic Execution
- User-Defined Function Optimizations
- Security and Privacy Risks of Browser Extensions
- Dataflow, Superscalar Execution & Branch Prediction
Show 5 moreShow fewer
- VLIW and Systolic Array Architectures
- Chopping Binary Executables: Object File Recovery and Modular Decomposition
- Fail: Jmp Fail (Everything I Got Wrong in RE and Security Research)
- Deobfuscation of a Real World Binary Obfuscator
- Hash All The Things / Get All The Sig(s): Automatic Function Detection for Reverse Engineers