Tuesday, September 24

 
8.00 	Registration

8.20 	Opening SAS

8.30 	Invited talk
           Flemming Nielson:
                Semantics-Directed Program Analysis: A Tool-Maker's

9.30 	SAS session
    	   Arnaud Venet:
    		Abstract Cofibered Domains: Application to the Alias Analysis of Untyped Programs
     	   Mario Coppo, Ferruccio Damiani, Paola Giannini:
     		Refinement Types for Program Analysis

10.30 	Coffee break

11.00 	SAS session
   	   Martin Alt, Christian Ferdinand, Florian Martin, Reinhard Wilhelm:
		Cache Behavior Prediction by Abstract Interpretation
	   M. Bruynooghe, B. Demoen, D. Boulanger, M. Denecker, A. Mulkers:
		A Freeness and Sharing Analysis of Logic Programs
		Based on a Pre-interpretation
	   Lobel Crnogorac, Andrew D. Kelly, Harald Sondergaard:
		A Comparison of Three Occur-Check Analysers

12.30 	Lunch

14.00 	Invited talk 
           Alex Aiken:
                Constraint-Based Program Analysis

15.00   SAS session
 	   Valery Trifonov, Scott Smith:
		Subtyping Constrained Types

15.30 	Coffee break

16.00 	SAS session (until 18.00)
	   Jakob Rehof, Torben AE. Mogensen:
		Tractable Constraints in Finite Semilattices
	   Christian Fecht, Helmut Seidl:
		An Even Faster Solver for General Systems of Equations
	   F.S. de Boer, M. Gabbrielli, C. Palamidessi:
		Proving Correctness of Constraint Logic Programs with Dynamic Scheduling
	   Pavel G. Emeljanov:
		Analysis of the equality relations for the program terms

18.30 	EAPLS founding meeting