SAS'95 call-for-participation

Call for participation: International Static Analysis Symposium (SAS'95)


Kelvin Conference Centre, Glasgow, 25--27 September 1995


The programme, call-for-participation and registration information are
available on
      http://www.cl.cam.ac.uk/users/am/sas-95
If requested I will mail out latex sources to people who cannot access
WWW documents.


I look forward to seeing many of you in Glasgow.
The list of papers to be presented is attached.


Alan Mycroft, SAS'95 PC chair.
========
Invited speakers, refereed papers and system descriptions for SAS'95
--------------------------------------------------------------------


Invited speakers:
-----------------


David Schmidt (Kansas State)
Natural-Semantics-Based Abstract Interpretation


Mads Tofte (Copenhagen)
Region inference


Pierre Wolper (Li\`ege)
An Automata-Theoretic Approach to Arithmetic Constraints


Refereed papers:
----------------


Generation of efficient interprocedural analyzers with PAG
Martin Alt and Florian Martin (Saarbr\"ucken)


Optimality in Abstractions of Model Checking
Rance Cleaveland, Purush Iyer (North Carolina State) and
    Daniel Yankelevich (Buenos Aires)


Determining Storage Properties of Sequential and Concurrent Programs with
    Assignment and Structured Data
Christopher Colby (Carnegie Mellon)


Partitioning Non-strict Functional Languages for Multi-threaded Code Generation
Satyan R. Coorg (MIT)


Complementation in Abstract Interpretation
A. Cortesi (Venezia), G. Fil\'e (Padova), R. Giacobazzi (Ecole Polytechnique),
    C. Palamidessi (Genova) and F. Ranzato (Padova)


Polymorphic Recursion and Subtype Qualifications:
    Polymorphic Binding-Time Analysis in Polynomial Time
Dirk Dussart (Leuven), Fritz Henglein and Christian Mossin (Copenhagen)


Optimizing lazy functional programs using flow inference
Karl-Filip Fax\'en (Stockholm)


Termination Analysis for Functional Programs using Term Orderings
J\"urgen Giesl (Darmstadt)


A Type-based Analysis for Stack Allocation in Functional Languages
John Hannan (Pennsylvania State)


Control-Flow Analysis and Type Systems
Nevin Heintze (Carnegie Mellon)


Effective Flow Analysis for Avoiding Run-Time Checks
Suresh Jagannathan and Andrew Wright (NEC Research, Princeton)


Static Analysis of Communication for Asynchronous Concurrent Programming
    Languages
Naoki Kobayashi, Motoki Nakade and Akinori Yonezawa (Tokyo)


Unification-free execution of well-moded and well-typed Prolog programs
M.R.K. Krishna Rao and R.K. Shyamasundar (Bombay)


Efficient Closure Utilisation by Higher-Order Inheritance Analysis
Markus Mohnen (Aachen)


System F and Abstract Interpretation
Bruno Monsuez (ENS Paris)


Call-By-Name CPS-Translation as a Binding-Time Improvement
Kristian Nielsen and Morten Heine S{\oe}rensen (Copenhagen)


Trust in the Lambda Calculus
Jens Palsberg and Peter {\O}rb{\ae}k (Aarhus)


LSign Reordered
Viswanath Ramachandran and Pascal Van Hentenryck (Brown University)


Abstract Reduction Using a Tableau Calculus
Manfred Schmidt-Schau{\ss}, Sven Eric Panitz and Marko Sch\"utz (Frankfurt)


Bigloo: a portable and optimizing compiler for strict functional languages
Manuel Serrano and Pierre Weis (INRIA Rocquencourt)


Beyond Prototype Implementations: Polymorphic Projection Analysis for
    Glasgow Haskell
Julian Seward (Manchester)


Binding-Time Analysis and Strictness Analysis by Abstract Interpretation
Franck V\'edrine (ENS Paris)


System descriptions:
--------------------


{\sc Gena}---a tool for generating Prolog analyzers from specifications
Christian Fecht (Saarbr\"ucken)


{\sc Igor}: A tool for developing Prolog dataflow analyzers
Magnus Nordin, Thomas Lindgren and H{\aa}kan Millroth (Uppsala)


--

Return to the comp.compilers page.
Search the comp.compilers archives again.