Definition of Set Constraints

Set Constraints for Algebraic Datatype Inference

Solving Set Constraints using Monadic Class

More on set constraints:

• Introduction to set constraint-based analysis
• Practical aspects of set based analysis
• Banshee
• The complexity of set constraints
• Bachmair, Ganzinger, Waldmann: Set constraints are the monadic class
• References for a mini course on set constraints
• Set-based analysis papers
• sav07_lecture_22
• sav07_lecture_23

Continuing lecture24 on aliasing, pointer, and shape analysis.

Galois Connection for Heap Analysis

Allocation-Site Based Model and Instrumented Semantics

Representation of Pointer Analysis Using Set Constraints

Flow Sensitive vs Flow Insensitive Analysis - constraining facts at all points to be equal

Path Sensitivity through Powerset Domain

Pointer Analyses

Shape Analysis

Symbolic Shape Analysis

Merging Control Flow Graphs and False Paths

Inlining

Modular Analysis with Supplied Contracts

Synthesizing Contracts

Using Set Constraints with Projections to Eliminate False Paths

Control-Flow Analysis and Dynamic Dispatch

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.
• Interconvertibility of a class of set constraints and context-free language reachability
• The Set Constraint/CFL Reachability Connection in Practice
• Control-flow analysis of higher-order languages
• sav07_lecture_20
• sav07_lecture_21

• Lecture notes on static analysis by Michael Schwartzbach (sections 4,5,6,7 in particular), and pdf file
• Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis