Differences

This shows you the differences between two versions of the page.

--- sav08:lecture25 [2008/05/22 13:34]
vkuncak
+++ sav08:lecture25 [2008/05/22 13:49]
vkuncak
@@ Line 20: / Line 20: @@
   * [[:sav07_lecture_22]]
   * [[:sav07_lecture_23]]
 ===== Pointer and Shape Analysis =====
 Continuing [[lecture24]] on aliasing, pointer, and shape analysis.
+Galois Connection for Heap Analysis
+Allocation-Site Based Model and Instrumented Semantics
+Representation Using Set Constraints
+Flow Sensitive vs Flow Insensitive Analysis
+Path Sensitivity through Powerset Domain
 [[Pointer Analyses]]
@@ Line 32: / Line 43: @@
 ===== Interprocedural Analysis =====
+Merging Control Flow Graphs and False Paths
+Inlining
+Modular Analysis with Supplied Contracts
+Synthesizing Contracts
+Using Set Constraints with Projections
   * [[:sav07_lecture_20]]
@@ Line 39: / Line 60: @@
 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://theory.stanford.edu/~aiken/publications/papers/pldi04.pdf|The Set Constraint/CFL Reachability Connection in Practice]]
@@ Line 46: / Line 69: @@
   * [[http://www.brics.dk/~mis/static.pdf|Lecture notes on static analysis by Michael Schwartzbach]] (sections 4,5,6,7 in particular), and {{sav08:schwartzbach.pdf|pdf file}}
+  * [[http://infoscience.epfl.ch/record/104078|Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis]]