Static Analysis

1. Front Matter

   PDF

2. The costs and benefits of abstract interpretation-driven Prolog optimization

   • Thomas W. Getzinger

   Pages 1-25

3. Mode analysis of functional logic programs

   • Michael Hanus, Frank Zartmann

   Pages 26-42

4. Directional type checking of logic programs

   • Alexander Aiken, T. K. Lakshman

   Pages 43-60

5. A systematic construction of abstract domains

   • Dmitri Boulanger, Maurice Bruynooghe

   Pages 61-77

6. Constraint-based type inference and parametric polymorphism

   • Ole Agesen

   Pages 78-100

7. Efficient on-the-fly analysis of program behavior and static cache simulation

   • Frank Mueller, David B. Whalley

   Pages 101-115

8. From processor timing specifications to static instruction scheduling

   • Ed Harcourt, Jon Mauney, Todd Cook

   Pages 116-130

9. Stackability in the simply-typed call-by-value lambda calculus

   • Anindya Banerjee, David A. Schmidt

   Pages 131-146

10. Generalized boxings, congruences and partial inlining

    • Jean Goubault

    Pages 147-161

11. Selective thunkification

    • Paul Steckler, Mitchell Wand

    Pages 162-178

12. About synchronous programming and abstract interpretation

    • Nicolas Halbwachs

    Pages 179-192

13. Uniqueness and completeness analysis of array comprehensions

    • David Garza-Salazar, Wim Böhm

    Pages 193-207

14. Extent analysis of data fields

    • Björn Lisper, Jean -Francois Collard

    Pages 208-222

15. Verification of linear hybrid systems by means of convex approximations

    • Nicolas Halbwachs, Yann -Eric Proy, Pascal Raymond

    Pages 223-237

16. Compile-time detection of uncaught exceptions in Standard ML programs

    • Kwangkeun Yi

    Pages 238-254

17. Estimating the computational cost of logic programs

    • S. K. Debray, P. López García, M. Hermenegildo, N. -W. Lin

    Pages 255-265

18. Boolean functions for dependency analysis: Algebraic properties and efficient representation

    • Tania Armstrong, Kim Marriott, Peter Schachte, Harald Søndergaard

    Pages 266-280

19. Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop

    • Michael Codish, Bart Demoen

    Pages 281-296

20. Extracting Non-strict independent and-parallelism using sharing and freeness information

    • Daniel Cabeza Gras, Manuel Hermenegildo

    Pages 297-313

This volume presents the proceedings of the First International Static Analysis Symposium (SAS '94), held in Namur, Belgium in September 1994.
The proceedings comprise 25 full refereed papers selected from 70 submissions as well as four invited contributions by Charles Consel, Saumya K. Debray, Thomas W. Getzinger, and Nicolas Halbwachs. The papers address static analysis aspects for various programming paradigms and cover the following topics: generic algorithms for fixpoint computations; program optimization, transformation and verification; strictness-related analyses; type-based analyses and type inference; dependency analyses and abstract domain construction.

• Abstract Interpretation
• Abstrakte Interpretation
• Functional Programming
• Funktionales Programmieren
• Logic Programming
• Programmiertheorie
• Programming Theory
• Static Analysis
• algorithm
• algorithms
• optimization
• programming
• verification

Policies and ethics