Static Analysis Book

	The Costs and Benefits of Abstract Interpretation-driven Prolog Optimization	1
	Mode Analysis of Functional Logic Programs	26
	Directional Type Checking of Logic Programs	43
	A Systematic Construction of Abstract Domains	61
	Constraint-Based Type Inference and Parametric Polymorphism	78
	Efficient On-the-fly Analysis of Program Behavior and Static Cache Simulation	101
	From Processor Timing Specifications to Static Instruction Scheduling	116
	Stackability in the Simply-Typed Call-by-value Lambda Calculus	131
	Generalized Boxings, Congruences and Partial Inlining	147
	Selective Thunkification	162
	About Synchronous Programming and Abstract Interpretation	179
	Uniqueness and Completeness Analysis of Array Comprehensions	193
	Extent Analysis of Data Fields	208
	Verification of Linear Hybrid Systems by Means of Convex Approximations	223
	Compile-time Detection of Uncaught Exceptions in Standard ML Programs	238
	Estimating the Computational Cost of Logic Programs	255
	Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation	266
	Deriving Polymorphic Type Dependencies for Logic Programs using Multiple Incarnations of Prop	281
	Extracting Non-strict Independent And-parallelism using Sharing and Freeness Information	297
	Efficient FixPoint Computation	314
	Finding Fixpoints in Finite Function Spaces using Neededness Analysis and Chaotic Iteration	329
	Efficient Strictness Analysis of Haskell	346
	Abstract Interpretation using TDGs	363
	A Type-based Framework for Program Analysis	380
	Iterative Fixed Point Computation for Type-Based Strictness Analysis	395
	Strictness and Totality Analysis	408
	Fast Strictness Analysis Via Symbolic Fixpoint Iteration	423
	Generating Transformers for Deforestation and Supercompilation	432
	Mechanical Elimination of Commutative Redundancy	449
	Author Index	465