【2023教学课件】剑桥大学：优化编译器

Lecture 1: Introduction

Lecture 2: Unreachable-code & -procedure elimination

Lecture 3: Live variable analysis

Lecture 4: Available expression analysis

Lecture 5: Data-flow anomalies and clash graphs

Lecture 6: Register allocation

Lecture 7: Redundancy elimination

Lecture 8: Static single-assignment; strength reduction

Lecture 9: Abstract interpretation

Lecture 10: Strictness analysis

Lecture 11: Constraint-based analysis

Lecture 12: Inference-based analysis

Lecture 13: Effect systems

Lecture 13a: Alias and points-to analysis

Lecture 14: Instruction scheduling

Lecture 15: Register allocation vs. instruction scheduling; legality of reverse engineering

Lecture 16: Decompilation