Scribes for Program Analysis
Created by January 17 batch students.
- DFA (CFG, Reaching Definitions)
- DFA (Live Variables Analysis, DFA Framework, Analysis Dimensions)
- DFA (Abstract Interpretation, Safety vs Liveness) + Pointer Analysis (Normalization)
- Pointer Analysis (as a DFA, Design Decisions, Andersen's Analysis, Steensgaard's Analysis)
- Pointer Analysis (Steensgaard's Analysis, Unifying Models, Realizable Facts)
- Pointer Analysis (as a Graph Problem, Online Cycle Detection, Offline Variable Substitution)
- Pointer Analysis (Constraint Order, Prioritization, Applications, Parallelization)
- Pointer Analysis (Replication-Based Parallel)
- Parallelization (Amdahl's Law, Dependence, Iteration Vector)
- Parallelization (ILP, Data Race)
- Parallelization (Linked List, Locks, Barriers) + Security (malloc, Null Pointer Analysis, Stack Smashing, Pre-Post Conditions)
- Shape Analysis (Limitations of Pointer Analysis, Tree / DAG / Cycle)
- Shape Analysis (Tree / DAG / Cycle) + Slicing (Applications, Types, )
- Slicing (Relevant Variables and Statements, Control Dependence, Static, Dynamic, PDG, Syntactically Valid Slices)
Additional topics: