SAS 1997
33 papers
- Abstract Interpretation Based Static Analysis Parameterized by Semantics
- Abstract Interpretation from Improving WAM Code
- Abstract Interpretation: A Theory of Approximate Computation
- An Algebraic Approach to Sharing Analysis of Logic Programs
- Attribute Grammars and Functional Programming Deforestation
- Automatic Termination Analysis for Partial Functions Using Polynomial Orderings
- Can Abstract Interpretation Become a Mainstream Compiler Technology? (Abstract)
- Coalescing Conditional Branches into Efficient Indirect Jumps
- Combining Abstract Interpretation and Partial Evaluation (Brief Overview)
- Data Dependence as Abstract Interpretations
- Denotational Abstract Interpretation of Functional Logic Programs
- Effective Specialization of Realistic Programs via Use Sensitivity
- Exact Flow Analysis
- Fast and Effective Procedure Inlining
- Logical Optimality of Groundness Analysis
- On Sparse Evaluation Representations
- On the Desirable Link Between Theory and Practice in Abstract Interpretation (Extended Abstract)
- Practical Compile-Time Analysis
- Program Analysis Using Mixed Term and Set Constraints
- Satisfying Subtype Inequalities in Polynomial Space
- Semantic Analyzer of Modula-Programs
- Set-Based Analysis for Logic Programming and Tree Automata
- Set-Sharing is Redundant for Pair-Sharing
- Static Analyses of Congruence Properties on Rational Numbers (Extended Abstract)
- Static Analysis of Interaction Nets for Distributed Implementations
- TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language
- Termination Analysis for Mercury
- The Effects of the Precision of Pointer Analysis
- The Power of QDDs (Extended Abstract)
- Towards a Cost-Effective Estimation of Uncaught Exceptions in SML Programs
- True Concurrency via Abstract Interpretation
- Type-Based Analysis of Communication for Concurrent Programming Languages
- Type-Directed Flow Analysis for Typed Intermediate Languages