2. SAS 1995: Glasgow, UK
Alan Mycroft (Ed.):
Static Analysis, Second International Symposium, SAS'95, Glasgow, UK, September 25-27, 1995, Proceedings.
Lecture Notes in Computer Science 983 Springer 1995, ISBN 3-540-60360-3 
Invited Talks
- David A. Schmidt:
Natural-Semantics-Based Abstract Interpretation (Preliminary Version).
1-18
- Mads Tofte:
Region Inference for Higher-Order Functional Languages.
19-20
- Pierre Wolper, Bernard Boigelot:
An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract).
21-32
Contributed Papers
- Martin Alt, Florian Martin:
Generation of Efficient Interprocedural Analyzers with PAG.
33-50
- Rance Cleaveland, S. Purushothaman Iyer, Daniel Yankelevich:
Optimality in Abstractions of Model Checking.
51-63
- Christopher Colby:
Determining Storage Properties of Sequential and Concurrent Programs with Assignment and Structured Data.
64-81
- Satyan R. Coorg:
Partitioning Non-strict Functional Languages for Multi-threaded Code Generation.
82-99
- Agostino Cortesi, Gilberto Filé, Roberto Giacobazzi, Catuscia Palamidessi, Francesco Ranzato:
Complementation in Abstract Interpretation.
100-117
- Dirk Dussart, Fritz Henglein, Christian Mossin:
Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time.
118-135
- Karl-Filip Faxén:
Optimizing Lazy Functional Programs Using Flow Inference.
136-153
- Jürgen Giesl:
Termination Analysis for Functional Programs using Term Orderings.
154-171
- John Hannan:
A Type-based Analysis for Stack Allocation in Functional Languages.
172-188
- Nevin Heintze:
Control-Flow Analysis and Type Systems.
189-206
- Suresh Jagannathan, Andrew K. Wright:
Effective Flow Analysis for Avoiding Run-Time Checks.
207-224
- Naoki Kobayashi, Motoki Nakade, Akinori Yonezawa:
Static Analysis of Communication for Asynchronous Concurrent Programming Languages.
225-242
- M. R. K. Krishna Rao, R. K. Shyamasundar:
Unification-Free Execution of Well-Moded and Well-Typed Prolog Programs.
243-260
- Markus Mohnen:
Efficient Closure Utilisation by Higher-Order Inheritance Analysis.
261-278
- Bruno Monsuez:
System F and Abstract Interpretation.
279-295
- Kristian Nielsen, Morten Heine Sørensen:
Call-By-Name CPS-Translation as a Binding-Time Improvement.
296-313
- Jens Palsberg, Peter Ørbæk:
Trust in the lambda-Calculus.
314-329
- Viswanath Ramachandran, Pascal Van Hentenryck:
LSign Reordered.
330-347
- Manfred Schmidt-Schauß, Sven Eric Panitz, Marko Schütz:
Abstract Reduction Using a Tableau Calculus.
348-365
- Manuel Serrano, Pierre Weis:
Bigloo: A Portable and Optimizing Compiler for Strict Functional Languages.
366-381
- Julian Seward:
Beyond Prototype Implementations: Polymorphic Projection Analysis for Glasgow Haskell.
382-399
- Franck Védrine:
Binding-Time Analysis and Strictness Analysis by Abstract Interpretation.
400-417
System Descriptions
Copyright © Mon Nov 2 21:07:34 2009
by Michael Ley (ley@uni-trier.de)
