Static Analysis Book

	Natural-Semantics-Based Abstract Interpretation	1
	Region Inference for Higher-Order Functional Languages	19
	An Automata-Theoretic Approach to Presburger Arithmetic Constraints	21
	Generation of Efficient Interprocedural Analyzers with PAG	33
	Optimality in Abstractions of Model Checking	51
	Determining Storage Properties of Sequential and Concurrent Programs with Assignment and Structured Data	64
	Partitioning Non-Strict Functional Languages for Multi-Threaded Code Generation	82
	Complementation in Abstract Interpretation	100
	Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time	118
	Optimizing Lazy Functional Programs Using Flow Inference	136
	Termination Analysis for Functional Programs Using Term Orderings	154
	A Type-Based Analysis for Stack Allocation in Functional Languages	172
	Control-Flow Analysis and Type Systems	189
	Effective Flow Analysis for Avoiding Run-Time Checks	207
	Static Analysis of Communication for Asynchronous Concurrent Programming Languages	225
	Unification-Free Execution of Well-Moded and Well-Typed Prolog Programs	243
	Efficient Closure Utilisation by Higher-Order Inheritance Analysis	261
	System F and Abstract Interpretation	279
	Call-By-Name CPS-Translation as a Binding-Time Improvement	296
	Trust in the Lambda Calculus	314
	LSign Reordered	330
	Strictness Analysis by Abstract Reduction Using a Tableau Calculus	348
	Bigloo: a Portable and Optimizing Compiler for Strict Functional Languages	366
	Beyond Prototype Implementations: Polymorphic Projection Analysis for Glasgow Haskell	382
	Binding-Time Analysis and Strictness Analysis by Abstract Interpretation	400
	GENA - a Tool for Generating Prolog Analyzers from Specifications	418
	Igor: A Tool for Developing Prolog Dataflow Analyzers	420
	Author Index	423