SAS 1995

27 papers

1. A Type-based Analysis for Stack Allocation in Functional Languages · John Hannan
2. Abstract Reduction Using a Tableau Calculus · Manfred Schmidt-Schauß, Sven Eric Panitz, Marko Schütz
3. An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract) · Pierre Wolper, Bernard Boigelot
4. Beyond Prototype Implementations: Polymorphic Projection Analysis for Glasgow Haskell · Julian Seward
5. Bigloo: A Portable and Optimizing Compiler for Strict Functional Languages · Manuel Serrano, Pierre Weis
6. Binding-Time Analysis and Strictness Analysis by Abstract Interpretation · Franck Védrine
7. Call-By-Name CPS-Translation as a Binding-Time Improvement · Kristian Nielsen, Morten Heine Sørensen
8. Complementation in Abstract Interpretation · Agostino Cortesi, Gilberto Filé, Roberto Giacobazzi, Catuscia Palamidessi, Francesco Ranzato
9. Control-Flow Analysis and Type Systems · Nevin Heintze
10. Determining Storage Properties of Sequential and Concurrent Programs with Assignment and Structured Data · Christopher Colby
11. Effective Flow Analysis for Avoiding Run-Time Checks · Suresh Jagannathan, Andrew K. Wright
12. Efficient Closure Utilisation by Higher-Order Inheritance Analysis · Markus Mohnen
13. GENA - A Tool for Generating Prolog Analyzers from Specifications · Christian Fecht
14. Generation of Efficient Interprocedural Analyzers with PAG · Martin Alt, Florian Martin
15. IGOR: A Tool for Developing Prolog Dataflow Analyzers · Magnus Nordin, Thomas Lindgren, Håkan Millroth
16. LSign Reordered · Viswanath Ramachandran, Pascal Van Hentenryck
17. Natural-Semantics-Based Abstract Interpretation (Preliminary Version) · David A. Schmidt
18. Optimality in Abstractions of Model Checking · Rance Cleaveland, S. Purushothaman Iyer, Daniel Yankelevich
19. Optimizing Lazy Functional Programs Using Flow Inference · Karl-Filip Faxén
20. Partitioning Non-strict Functional Languages for Multi-threaded Code Generation · Satyan R. Coorg
21. Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time · Dirk Dussart, Fritz Henglein, Christian Mossin
22. Region Inference for Higher-Order Functional Languages · Mads Tofte
23. Static Analysis of Communication for Asynchronous Concurrent Programming Languages · Naoki Kobayashi, Motoki Nakade, Akinori Yonezawa
24. System F and Abstract Interpretation · Bruno Monsuez
25. Termination Analysis for Functional Programs using Term Orderings · Jürgen Giesl
26. Trust in the lambda-Calculus · Jens Palsberg, Peter Ørbæk
27. Unification-Free Execution of Well-Moded and Well-Typed Prolog Programs · M. R. K. Krishna Rao, R. K. Shyamasundar