SAS 1996
28 papers
- A Backward Slicing Algorithm for Prolog
- A Comparison of Three Occur-Check Analysers
- A Freeness and Sharing Analysis of Logic Programs Based on a Pre-interpretation
- Abstract Cofibered Domains: Application to the Alias Analysis of Untyped Programs
- An Even Faster Solver for General Systems of Equations
- Analysis of the Equality Relations for the Program Terms
- Automated Modular Termination Proofs for Real Prolog Programs
- Cache Behavior Prediction by Abstract Interpretation
- Combining Slicing and Constraint Solving for Validation of Measurement Software
- Compiling Laziness Using Projections
- Constraint-Based Program Analysis (Abstract)
- Data-Flow-Based Virtual Function Resolution
- Generalized Dominators for Structured Programs
- Inferring Program Specifications in Polynomial-Time
- Optimized Algorithms for Incremental Analysis of Logic Programs
- PAN - The Prolog Analyzer
- Property-Oriented Expansion
- Proving Correctness of Constraint Logic Programs with Dynamic Scheduling
- Refinement Types for Program Analysis
- STAN: A Static Analyzer for CLP(R) Based on Abstract Interpretation
- Semantics-Directed Program Analysis: A Tool-Maker's Perspective
- Subtyping Constrained Types
- Termination Analysis for Offline Partial Evaluation of a Higher Order Functional Language
- Termination Analysis for Partial Functions
- Tractable Constraints in Finite Semilattices
- Two Applications of an Incremental Analysis Engine for (Constraint) Logic Programs
- Understanding Mobile Agents via a Non-Interleaving Semantics for Facile
- Uniformity for the Decidability of Hybrid Automata