Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
sav08:lecture25 [2008/05/22 13:41] vkuncak |
sav08:lecture25 [2008/05/22 13:53] vkuncak |
||
---|---|---|---|
Line 44: | Line 44: | ||
===== Interprocedural Analysis ===== | ===== Interprocedural Analysis ===== | ||
- | * [[:sav07_lecture_20]] | + | Merging Control Flow Graphs and False Paths |
- | * [[:sav07_lecture_21]] | + | |
+ | Inlining | ||
+ | |||
+ | Modular Analysis with Supplied Contracts | ||
+ | |||
+ | Synthesizing Contracts | ||
+ | |||
+ | Using Set Constraints with Projections | ||
Control-Flow Analysis and Dynamic Dispatch | Control-Flow Analysis and Dynamic Dispatch | ||
More on interprocedural analysis: | More on interprocedural analysis: | ||
+ | * M. Sharir, and A. Pnueli. Two Approaches to Inter-Procedural Data-Flow Analysis. In Jones and Muchnik, editors, Program Flow Analysis: Theory and Applications. Prentice-Hall, 1981. | ||
+ | * F. Nielson, H. R. Nielson, C. Hankin: Principles of program analysis, 2005. Chapter 2.5. | ||
* [[http://www.cs.wisc.edu/wpis/papers/tcs_submission98r2.pdf|Interconvertibility of a class of set constraints and context-free language reachability]] | * [[http://www.cs.wisc.edu/wpis/papers/tcs_submission98r2.pdf|Interconvertibility of a class of set constraints and context-free language reachability]] | ||
* [[http://theory.stanford.edu/~aiken/publications/papers/pldi04.pdf|The Set Constraint/CFL Reachability Connection in Practice]] | * [[http://theory.stanford.edu/~aiken/publications/papers/pldi04.pdf|The Set Constraint/CFL Reachability Connection in Practice]] | ||
* {{shivers-diss.ps|Control-flow analysis of higher-order languages}} | * {{shivers-diss.ps|Control-flow analysis of higher-order languages}} | ||
+ | * [[:sav07_lecture_20]] | ||
+ | * [[:sav07_lecture_21]] | ||
===== General Reference ===== | ===== General Reference ===== |