[TYPES] Call for Participation/Programme: SAS'05

[Herbert Wiklicky]

                          CALL FOR PARTICIPATION

                                  SAS'05
         The 12th International Static Analysis Symposium Imperial
	    College London, United Kingdom September 7-9, 2005

                             Organised by
             Department of Computing, Imperial College London

                  On-line Registration and symposium information:
                       http://www.doc.ic.ac.uk/~sas2005
               DEADLINE FOR EARLY REGISTRATION IS JULY 24, 2005

The Twelveth International Static Analysis Symposium (SAS'05) will be held at
Imperial College London, co-located with the International Symposium on Logic-
based Program Development and Transformation (LOPSTR'05) and the Workshop
on Programming Language Dependence and Interference (PLID'05).

Static Analysis is increasingly recognized as a fundamental tool for high
performance implementations and verification of programming languages and
systems. The series of Static Analysis Symposia has served as the primary
venue for presentation of theoretical, practical, and application advances
in the area.  The twelfth International Static Analysis Symposium (SAS'05)
will be held in London. Previous symposia were held in Verona, San Diego,
Madrid, Paris, Santa Barbara, Venice, Pisa, Paris, Aachen, Glasgow and Namur.

The technical program for SAS'05 will consist of invited lectures and
presentations of refereed papers on all aspects of Static Analysis,
including, but not limited to:

abstract domains      abstract interpretation	  security analysis
abstract testing      complexity analysis	  type inference
data flow analysis    model checking		  theoretical frameworks
optimizing compilers  program specialization	  verification systems

** Invited Speakers **
- Samson Abramsky, Oxford University Computing Laboratory, UK.
- Francois Fages, INRIA, France.
- Andrew Gordon, Microsoft Research, UK.


** Programme **

* Wednesday, July 7 *
09.00-10.00 Invited Talk:
- Francois Fages, INRIA.
10.00-10.30  Coffee
10.30-12.30  Session 1:
- Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra.
  Roberto Bagnara, Enric Rodríguez-Carbonell, Enea Zaffanella.
- Exploiting Sparsity in Polyhedral Analysis .
  Axel Simon, Andy King.
- A Relational Abstraction for Functions .
  Bertrand Jeannet, Denis Gopan, Thomas Reps.
- Locality-based Abstractions.
  Javier Esparza, Pierre Ganty, Stefan Schwoon.
12.30-14.00  Lunch
14.00-15.30  Session 2:
- Interprocedural Shape Analysis for Cutpoint-Free Programs.
  Noam Rinetzky, Mooly Sagiv, Eran Yahav.
- Boolean Heaps .
  Andreas Podelski, Thomas Wies.
- Finding Basic Block and Variable Correspondence .
  Iman Narasamdya, Andrei Voronkov.
15.30-16.00  Coffee
16.00-17.00  Session 3:
- Pair-Sharing Analysis of Object-Oriented Programs .
  Stefano Secci, Fausto Spoto
- Memory Usage Verification for OO Programs .
 Wei-Ngan Chin, Huu Hai Nguyen, Shengchao Qin, Martin Rinard.


* Thursday, July 8 *
09.00-10.00 Invited Talk
- Samson Abramsky. Oxford University Computing Laboratory.
  Algorithmic Game Semantics and Static Analysis .
10.00-10.30  Coffee
10.30-12.30  Session 4:
- Data-Abstraction Refinement: A Game Semantic Approach.
  Aleksandar Dimovski, Dan R. Ghica, Ranko Lazic.
- Abstraction Refinement for Termination.
  Byron Cook, Andreas Podelski, Andrey Rybalchenko.
- A Generic Framework for Interprocedural Analysis of Numerical Properties .
  Helmut Seidl, Markus Mueller-Olm.
- Widening Operators for Weakly-Relational Numeric Abstractions.
  Roberto Bagnara, Patricia M. Hill, Elena Mazzi, Enea Zaffanella.
12.30-14.00  Lunch
Afternoon:  Excursion
Evening:  Dinner


* Friday, July 9 *
09.00-10.00 Invited Talk
- Andrew Gordon. Microsoft Research.
  From Typed Process Calculi to Source-based Security.
10.00-10.30  Coffee
10.30-12.30  Session 5:
- Secure Information Flow as a Safety Problem .
  Tachio Terauchi, Alex Aiken.
- Using Dependent Types to Certify the Safety of Assembly Code.
  Matthew Harren, George C. Necula.
- The PER Model of Abstract Non-Interference.
  Sebastian Hunt, Isabella Mastroeni.
- Memory Space Conscious Loop Iteration Duplication for Reliable Execution .
  G. Chen, M. Kandemir, M. Karakoy.
12.30-14.00  Lunch
14.00-15.30  Session 6:
- Banshee: A Scalable Constraint-Based Analysis Toolkit .
  John Kodumal, Alex Aiken.
- Understanding the Origin of Alarms in Astree.
  Xavier Rival.
- Taming False Alarms from a Domain-Unaware C Analyzer by a Bayesian
  Statistical Post Analysis .
  Yungbum Jung, Jaehwang Kim, Jaeho Shin, Kwangkeun Yi.
15.30-16.00  Coffee
16.00-17.00  Session 7:
- Type-Safe Optimisation of Plugin Architectures.
  Neal Glew, Jens Palsberg, Christian Grothoff.
- Inference of Well-typings for Logic Programs with Application to
  Termination Analysis .
  Maurice Bruynooghe, John Gallagher, Wouter Van Humbeeck.


** Program Committee: **
- Thomas Ball (Microsoft, USA)
- Radhia Cousot (CNRS/Ecole Polytechnique, FR)
- Alessandra Di Pierro (U. Pisa, IT)
- Gilberto File (U. Padova, IT)
- Roberto Giacobazzi (U. Verona, IT)
- Chris Hankin (Imperial College, UK -- PC Chair)
- Thomas Jensen (IRISA/CNRS Rennes, FR)
- Andy King (U. Kent, UK)
- Pasquale Malacaria (Queen Mary College, UK)
- Laurent Mauborgne (ENS, FR)
- Alan Mycroft (U. Cambridge, UK)
- Andreas Podelski (MPI, DE)
- German Puebla (UPM, ES)
- Ganesan Ramalingam (IBM, USA)
- Andrei Sabelfeld (Chalmers, SE)
- Mooly Sagiv, (Tel Aviv, IL)
- Harald Sondergaard (U. Melbourne, AU)
- Bernhard Steffen (U. Dortmund, DE)

** Organising Committee **
- Bridget Gundry
- Igor Siveroni
- Herbert Wiklicky

** Contact address: **
Chris Hankin, SAS'05 PC Chair
Department of Computing
Imperial College London
South Kensington Campus
London SW7 2AZ
UK
e-mail: sas2005 at doc.ic.ac.uk