SAS 1994
29 papers
- A Systematic Construction of Abstract Domains
- A Type-based Framework for Program Analysis
- About Synchronous Programming and Abstract Interpretation
- Abstract Interpretation Using TDGs
- Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation
- Compile-time Detection of Uncaught Exceptions in Standard ML Programs
- Constraint-Based Type Inference and Parametric Polymorphism
- Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop
- Directional Type Checking of Logic Programs
- Efficient FixPoint Computation
- Efficient On-the-fly Analysis of Program Behavior and Static Cache Simulation
- Efficient Strictness Analysis of Haskell
- Estimating the Computational Cost of Logic Programs
- Extended Analysis of Data Fields
- Extracting Non-Strict Independent And-Parallelism Using Sharing and Freeness Information
- Fast Strictness Analysis Via Symbolic Fixpoint Iteration
- Finding Fixpoints in Finite Function Spaces Using Neddedness Analysis and Chaotic Iteration
- From Processor Timing Specifications to Static Intruction Scheduling
- Generalized Boxings, Congruences and Partial Inlining
- Generating Transformers for Deforestation and Supercompilation
- Iterative Fixed Point Computation for Type-Based Strictness Analysis
- Mechanical Elimination of Commutative Redundancy
- Mode Analysis of Functional Logic Programs
- Selective Thunkification
- Stackability in the Simply-Typed Call-by-Value Lambda Calculus
- Strictness and Totality Analysis
- The Costs and Benefits of Abstract Interpretation-driven Prolog Optimization
- Uniqueness and Completeness Analysis of Array Comprehensions
- Verification of Linear Hybrid Systems by Means of Convex Approximations