Abstract is missing.
- Constraint-Based Program Analysis (Abstract)Alexander Aiken. 1
- Semantics-Directed Program Analysis: A Tool-Maker s PerspectiveFlemming Nielson. 2-21
- Property-Oriented ExpansionBernhard Steffen. 22-41
- Generalized Dominators for Structured ProgramsStephen Alstrup, Peter W. Lauridsen, Mikkel Thorup. 42-51
- Cache Behavior Prediction by Abstract InterpretationMartin Alt, Christian Ferdinand, Florian Martin, Reinhard Wilhelm. 52-66
- Termination Analysis for Offline Partial Evaluation of a Higher Order Functional LanguagePeter Holst Andersen, Carsten Kehler Holst. 67-82
- Proving Correctness of Constraint Logic Programs with Dynamic SchedulingFrank S. de Boer, Maurizio Gabbrielli, Catuscia Palamidessi. 83-97
- Understanding Mobile Agents via a Non-Interleaving Semantics for FacileRoberta Borgia, Pierpaolo Degano, Corrado Priami, Lone Leth, Bent Thomsen. 98-112
- Termination Analysis for Partial FunctionsJürgen Brauburger, Jürgen Giesl. 113-127
- A Freeness and Sharing Analysis of Logic Programs Based on a Pre-interpretationMaurice Bruynooghe, Bart Demoen, Dmitri Boulanger, Marc Denecker, Anne Mulkers. 128-142
- Refinement Types for Program AnalysisMario Coppo, Ferruccio Damiani, Paola Giannini. 143-158
- A Comparison of Three Occur-Check AnalysersLobel Crnogorac, Andrew D. Kelly, Harald Søndergaard. 159-173
- Analysis of the Equality Relations for the Program TermsPavel G. Emeljanov. 174-188
- An Even Faster Solver for General Systems of EquationsChristian Fecht, Helmut Seidl. 189-204
- Inferring Program Specifications in Polynomial-TimeRobert Givan. 205-219
- Automated Modular Termination Proofs for Real Prolog ProgramsMartin Müller 0002, Thomas Glaß, Karl Stroetmann. 220-237
- Data-Flow-Based Virtual Function ResolutionHemant D. Pande, Barbara G. Ryder. 238-254
- Compiling Laziness Using ProjectionsRoss Paterson. 255-269
- Optimized Algorithms for Incremental Analysis of Logic ProgramsGermán Puebla, Manuel V. Hermenegildo. 270-284
- Tractable Constraints in Finite SemilatticesJakob Rehof, Torben Æ. Mogensen. 285-300
- Uniformity for the Decidability of Hybrid AutomataOlivier Roux, Vlad Rusu. 301-316
- A Backward Slicing Algorithm for PrologStéphane Schoenig, Mireille Ducassé. 317-331
- Combining Slicing and Constraint Solving for Validation of Measurement SoftwareGregor Snelting. 332-348
- Subtyping Constrained TypesValery Trifonov, Scott F. Smith. 349-365
- Abstract Cofibered Domains: Application to the Alias Analysis of Untyped ProgramsArnaud Venet. 366-382
- STAN: A Static Analyzer for CLP(R) Based on Abstract InterpretationMaria Handjieva. 383-384
- Two Applications of an Incremental Analysis Engine for (Constraint) Logic ProgramsAndrew D. Kelly, Kim Marriott, Harald Søndergaard, Peter J. Stuckey. 385-386
- PAN - The Prolog AnalyzerMartin Müller 0002, Thomas Glaß, Karl Stroetmann. 387-388