Static Analysis

1. Front Matter

   PDF

2. Natural-semantics-based abstract interpretation (preliminary version)

   • David A. Schmidt

   Pages 1-18

3. Region inference for higher-order functional languages

   • Mads Tofte

   Pages 19-20

4. An automata-theoretic approach to Presburger arithmetic constraints

   • Pierre Wolper, Bernard Boigelot

   Pages 21-32

5. Generation of efficient interprocedural analyzers with PAG

   • Martin Alt, Florian Martin

   Pages 33-50

6. Optimality in abstractions of model checking

   • Rance Cleaveland, Purush Iyer, Daniel Yankelevich

   Pages 51-63

7. Determining storage properties of sequential and concurrent programs with assignment and structured data

   • Christopher Colby

   Pages 64-81

8. Partitioning non-strict functional languages for multi-threaded code generation

   • Satyan R. Coorg

   Pages 82-99

9. Complementation in abstract interpretation

   • Agostino Cortesi, Gilberto Filé, Roberto Giacobazzi, Catuscia Palamidessi, Francesco Ranzato

   Pages 100-117

10. Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time

    • Dirk Dussart, Fritz Henglein, Christian Mossin

    Pages 118-135

11. Optimizing lazy functional programs using flow inference

    • Karl -Filip Faxén

    Pages 136-153

12. Termination analysis for functional programs using term orderings

    • Jürgen Giesl

    Pages 154-171

13. A type-based analysis for stack allocation in functional languages

    • John Hannan

    Pages 172-188

14. Control-flow analysis and type systems

    • Nevin Heintze

    Pages 189-206

15. Effective flow analysis for avoiding run-time checks

    • Suresh Jagannathan, Andrew Wright

    Pages 207-224

16. Static analysis of communication for asynchronous concurrent programming languages

    • Naoki Kobayashi, Motoki Nakade, Akinori Yonezawa

    Pages 225-242

17. Unification-free execution of well-moded and well-typed Prolog programs

    • M. R. K. Krishna Rao, R. K. Shyamasundar

    Pages 243-260

18. Efficient closure utilisation by higher-order inheritance analysis

    • Markus Mohnen

    Pages 261-278

19. System F and abstract interpretation

    • B. Monsuez

    Pages 279-295

20. Call-by-name CPS-translation as a binding-time improvement

    • Kristian Nielsen, Morten Heine Sørensen

    Pages 296-313

This book constitutes the refereed proceedings of the Second International Symposium on Static Analysis, SAS '95, held in Glasgow, UK, in September 1995. Static Analysis is increasingly recognized as a foundation for high-performance implementations and verification systems of high-level programming languages.
22 full revised papers selected from a total of 55 submissions are presented; they address static analysis issues for different programming paradigms; in particular concurrent, constraint, functional, imperative, logic, and object-oriented programming are addressed. In addition there are abstracts or full papers for three invited presentations and two system descriptions.

• High-Level Programming
• High-Performance Computing
• Höherstufiges Programmieren
• Performance
• Static Analysis
• Systemimplementierung
• Systems Implementation
• Systems Verfication
• programming
• programming language
• system

Policies and ethics