call for papers, previous message
From: dza@info.fundp.ac.be (Denis Zampunieris)
Subject: 1st International Static Analysis Symposium (SAS'94)
Date: 2 Aug 1994 07:49:29 -0500
===============================================================================
1st INTERNATIONAL STATIC ANALYSIS SYMPOSIUM
### ##### #
#### ## #### ### # # # #
# # # # # # # # #
#### # # #### # ###### # #
# ###### # # #######
# # # # # # # # #
#### # # #### ##### #
September 28-30, 1994
Namur, Belgium
FINAL PROGRAM AND REGISTRATION INFORMATION
Static Analysis is increasingly recognized as a fundamental tool for
high performance implementations and verification systems of high-level
programming languages. The last two decades have witnessed substantial
developments in this area, ranging from the theoretical frameworks to
the design and implementation of analysers and their applications in
optimizing compilers.
The First International Static Analysis Symposium is held in Namur,
Belgium, from 28-30 September 1994. It follows the three previous
international workshops JTASPEFL and WSA'92, which were held in Bordeaux
(France), and WSA'93 which took place in Padova (Italy).
The aim of SAS'94 is to promote contacts and information exchange among
scientists who share common interests in static analysis for different
programming paradigms.
Researchers from the fields of concurrent, constraint, functional,
imperative, logic and object-oriented programming constitute the audience
of SAS.
Namur is a pleasant provincial town, 35 miles south of Brussels in Belgium,
located in a scenic environment. Brussels and Paris are easily reached by
train.
SAS'94 is hosted by:
Institut d'Informatique
Facultes Universitaires Notre-Dame de la Paix de Namur
Rue Grandgagnage, 21
B-5000 Namur
and is sponsored by :
- Belgian National Fund for Scientific Research
- University of Namur (FUNDP) .
*** ONLINE INFORMATION
Public information is available in electronic form by FTP
from: ftp.info.fundp.ac.be:/pub/projects/sas94/sas94.ps
*** SAS'94 TECHNICAL PROGRAM
Wednesday, September 28
9:30-10:30 Invited Talk
The Costs and Benefits of Abstract Interpretation-driven
Prolog Optimization
Thomas W. Getzinger (Hughes Aircraft Company)
11:00-12:30 Logic Programming
Mode Analysis of Functional Logic Programs
Michael Hanus (Max-Planck-Institut fur Informatik)
Frank Zartmann (Max-Planck-Institut fur Informatik)
Directional Type Checking of Logic Programs
Alexander Aiken (University of California, Berkeley)
T.K. Lakshman (University of Illinois at Urbana-Champaign)
A Systematic Construction of Abstract Domains
Dmitri Boulanger (Katholieke Universiteit Leuven)
Maurice Bruynooghe (Katholieke Universiteit Leuven)
14:00-14:30 Object-Oriented Programming
Constraint-Based Type Inference and Parametric Polymorphism
Ole Agesen (Stanford University)
14:30-15:30 Instruction Scheduling
Efficient On-the-fly Analysis of Program Behavior
and Static Cache Simulation
Frank Mueller (Florida State University)
David Whalley (Florida State University)
From Processor Timing Specifications to Static Instruction Scheduling
Ed Harcourt (Chalmers University of Technology)
Jon Mauney (North Carolina State University)
Todd Cook (Rutgers University)
16:00-17:30 Functional Program Optimization
Stackability in the Typed Call-by-value Lambda Calculus
Anindya Banerjee (Kansas State University)
David A. Schmidt (Kansas State University)
Generalized Boxings, Congruences and Partial Inlining
Jean Goubault (Bull Corporate Research Center)
Selective Thunkification
Peter Steckler (Northeastern University)
Mitchell Wand (Northeastern University)
Thursday, September 29
8:30-9:30 Invited Talk
About Synchronous Programming and Abstract Interpretation
Nicolas Halbwachs (Verimag)
10:00-11:00 Extent Analysis
Uniqueness and Completeness Analysis of Array Comprehensions
David Garza-Salazar (Colorado State University)
Wim Bohm (Colorado State University)
Extent Analysis of Data Fields
Bjorn Lisper (Royal Institute of Technology, Sweden)
Jean-Francois Collard (LIP, ENS Lyon)
11:30-12:30 Verification
Verification of Linear Hybrid Systems by Means of Convex Approximations
Nicolas Halbwachs (Verimag)
Yann-Eric Proy (Merlin-Gerin)
Pascal Raymond (Verimag)
Compile-time Detection of Uncaught Exceptions in Standard ML Programs
Kwangkeun Yi (AT&T Bell Laboratories)
14:00-15:00 Invited Talk
Estimating the Computational Cost of Logic Programs
Saumya K. Debray (University of Arizona)
P. Lopez Garcia (University of Madrid)
Manuel Hermenegildo (University of Madrid)
N.-W. Lin (National Chung Cheng University)
15:30-17:00 Dependency Analyses for Logic Programming
Boolean Functions for Dependency Analysis:
Algebraic Properties and Efficient Representation
Tania Armstrong (Monash University)
Kim Marriott (Monash University)
Peter Schachte (University of Melbourne)
Harald Sondergaard (University of Melbourne)
Deriving Polymorphic Type Dependencies for Logic Programs
using Multiple Incarnations of Prop
Michael Codish (Ben-Gurion University)
Bart Demoen (Katholieke Universiteit Leuven)
Extracting Non-strict Independent And-parallelism using
Sharing and Freeness Information
Daniel Cabeza Gras (Universidad Politecnica de Madrid)
Manuel Hermenegildo (Universidad Politecnica de Madrid)
Friday, September 30
8:30-9:30 Generic Fixpoint Algorithms
Efficient Fixpoint Computation
B. Vergauwen (Katholieke Universiteit Leuven)
J. Wauman (Katholieke Universiteit Leuven)
J. Lewi (Katholieke Universiteit Leuven)
Finding Fixpoints in Finite Function Spaces using Needness
Analysis and Chaotic Iteration
Niels Jorgensen (Roskilde University)
10:00-11:00 Efficient Strictness Analysis
Efficient Strictness Analysis of Haskell
Kristian Damm Jensen (University of Copenhagen)
P. Hjaeresen (University of Copenhagen)
Mads Rosendahl (University of Copenhagen)
Abstract Interpretation using TDGs
Laurent Mauborgne (LIENS)
11:30-13:00 Type-based Analyses for Functional Programming
A Type-based Framework for Program Analysis
Chris Hankin (Imperial College)
Daniel Le Metayer (INRIA/IRISA)
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Fritz Henglein (University of Copenhagen)
Strictness and Totality Analysis
Kirsten Lackner Solberg (Aarhus University)
Hanne Riis Nielson (Aarhus University)
Flemming Nielson (Aarhus University)
14:30-15:30 Invited Talk
Fast Strictness Analysis Via Symbolic Fixpoint Iteration
Charles Consel (IRISA)
16:00-17:00 Transformation
Generating Transformers for Deforestation and Supercompilation
Robert Gluck (University of Copenhagen)
Jesper Jorgensen (University of Copenhagen)
Mechanical Elimination of Commutative Redundancy
Hessam Khoshnevisan (Imperial College)
Mohamad Afshar (University of Cambridge)
*** PROGRAM CHAIRMAN
Baudouin Le Charlier
Institut d'Informatique
Facult es Universitaires Notre-Dame de la Paix de Namur
Rue Grandgagnage, 21
B-5000 Namur (Belgium)
phone: +32-81-72.49.77
fax: +32-81-72.49.67
e-mail: ble@info.fundp.ac.be
*** PROGRAM COMMITTEE
Andrew Chien, University of Illinois at Urbana-Champaign, USA
Patrick Cousot, LIENS, Ecole Normale Sup erieure, France
Moreno Falaschi, University of Padova, Italy
Gilberto File, University of Padova, Italy
Pierre Jouvelot, CRI, Ecole des Mines de Paris, France
John Launchbury, Oregon Graduate Institute, USA
Baudouin Le Charlier, University of Namur (FUNDP), Belgium
Daniel Le Metayer, INRIA/IRISA, France
Xavier Leroy, INRIA Rocquencourt, France
Alan Mycroft, University of Cambridge, UK
Ulf Nilsson, Linkoping University, Sweden
Martin Odersky, University of Karlsruhe, Germany
Antoine Rauzy, LaBRi, University of Bordeaux, France
Uday Reddy, University of Illinois at Urbana-Champaign, USA
Mads Rosendahl, DIKU, University of Copenhagen, Denmark
Pascal Van Hentenryck, Brown University, USA
Peter Van Roy, DEC Paris Research Laboratory, France
Pierre Wolper, University of Liege, Belgium
*** ORGANIZING COMMITTEE
Baudouin Le Charlier / Denis Zampunieris / Christiane le Roy
Institut d'Informatique
Facultes Universitaires Notre-Dame de la Paix de Namur
Rue Grandgagnage, 21
B-5000 Namur (Belgium)
phone: +32-81-72.49.77 / 72.50.00 / 72.49.66
fax: +32-81-72.49.67
e-mail: {ble / dza / cleroy}@info.fundp.ac.be
*** CALL FOR DEMONSTRATIONS
This year's edition will also host a daily session for system demonstration.
You are invited to contact the organisers to arrange for your system to be
exhibited at the event. Exhibitions of interest include, but are not restricted
to, optimization tools, compilers, programming environments. Participants
willing to give one of such demonstration are urged to contact:
Naji Habra
Institut d'Informatique
Facult es Universitaires Notre-Dame de la Paix de Namur
Rue Grandgagnage, 21
B-5000 Namur (Belgium)
fax: +32-81-72.49.67
e-mail: nha@info.fundp.ac.be
*** STUDENT GRANTS
A limited number of student grants for attending the workshop is available.
The grant covers hotel accommodation and student registration. Applicants
should send by September 4th a short curriculum vitae and a letter of
presentation to:
Baudouin Le Charlier
Institut d'Informatique
Facult es Universitaires Notre-Dame de la Paix de Namur
Rue Grandgagnage, 21
B-5000 Namur (Belgium)
fax: +32-81-72.49.67
e-mail: ble@info.fundp.ac.be
*** PROCEEDINGS
Conference proceedings are published by Springer-Verlag in the series
``Lecture Notes in Computer Science'' and will be distributed at
the conference. Extra copies will be available.
*** REGISTRATION FORM
Fill and send the following form to:
SAS'94 -- Christiane le Roy
Institut d'Informatique
Facultes Universitaires Notre-Dame de la Paix de Namur
Rue Grandgagnage, 21
B-5000 Namur (Belgium)
e-mail: cleroy@info.fundp.ac.be
----- cut here -----
SAS'94 REGISTRATION FORM
Name: ...............................................................
Affiliation: ........................................................
Street Address: .....................................................
City: ...............................................................
State/Zip: .................. Country: .............................
Phone: ...................... Fax: .................................
E-mail: .............................................................
Vegetarian [ ]
Payment (select one):
Early registration, before September 9th, 1994
Registration [ ] 7,000 Bef
Student fee [ ] 4,000 Bef
Late registration, after September 9th, 1994
Registration [ ] 8,000 Bef
Student fee [ ] 5,000 Bef
The registration fee covers attendance, lunches, one copy of the
proceedings, refreshments, cocktails and the conference banquet.
Extra tickets for the banquet will be available at the registration
desk.
The student fee does not cover the banquet. Students must include
a note from their department or supervisor verifying student status.
Mode of payment (select one):
Post office credit transfer [ ]
At the symposium registration desk
(late registration only) [ ]
----- cut here -----
Make Post office credit transfer in belgian francs into:
CCP 000-0045250-48 of the FUNDP Namur
with mention: "SAS'94 - 9367"
===============================================================================
End of SAS'94 program
-- Denis Zampunieris
-- mail: Institute of Computer Science, University of Namur