[TYPES/announce] Call for Participation: SAS 2006

[Kwangkeun Yi]

*****************************************************************************
                          2nd Call For Participation

           The 13th International Static Analysis Symposium (SAS'06)
 
                             Seoul, Korea
                           29-31 August 2006
                      http://ropas.snu.ac.kr/sas06

*****************************************************************************
IMPORTANT DATES:   

 Early registration:   05 August 2006

SUMMARY

Static Analysis is increasingly recognized as a fundamental tool for
program verification, bug detection, compiler optimization, program
understanding, and software maintenance. The series of Static Analysis
Symposia has served as the primary venue for presentation of
theoretical, practical, and application advances in the area. 

The 13th SAS 2006 will held in Seoul, hosted by the Seoul National
University.  Previous symposia were held in London, Verona, San Diego,
Madrid, Santa Barbara, Venice, Pisa, Paris, Aachen, Glasgow and Namur.

We have
 - three invited speakers
 - 23 papers and presentations
 - social program including an exciting excursion and banquet

We hope to see you all at SAS'06 in Seoul!

INVITED TALKS 
 - Unleashing the Power of Static Analysis
    Manuvir Das, Microsoft
 - Separation Logic and Program Analysis
    Peter W. O'Hearn, Queen Mary, U. of London
 - Shape Analysis for Low-level Code
    Hongseok Yang, Seoul National U.

ACCEPTED PAPERS

 - Static Analysis in Disjunctive Numerical Domains
    Sriram Sankaranarayanan, Franjo Ivancic, Ilya Shlyakhter and Aarti Gupta
 - Static Analysis of Numerical Algorithms
    Eric Goubault and Sylvie Putot
 - Static Analysis of String Manipulations in Critical Embedded C Programs
    Xavier Allamigeon, Wenceslas Godard and Charles Hymans

 - Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
    Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz and Tomas Vojnar
 - Structural Invariants
    Ranjit Jhala, Rupak Majumdar and Ru-Gang Xu
 - Existential Label Flow Inference via CFL Reachability
    Polyvios Pratikakis, Jeffrey S. Foster and Michael Hicks

 - Abstract Interpretation with Specialized Definitions
    German Puebla, Elvira Albert and Manuel Hermenegildo 
 - Underapproximating Predicate Transformers
    David A. Schmidt
 - Combining Widening and Acceleration in Linear Relation Analysis
    Laure Gonnord and Nicolas Halbwachs
 - Beyond Iteration Vectors: Instancewise Relational Abstract Domains
    Pierre Amiranoff, Albert Cohen and Paul Feautrier

 - Specialized 3-Valued Logic Shape Analysis using Structure-Based Refinement
   and Loose Embedding
    Gilad Arnold
 - Recency-Abstraction for Heap-Allocated Storage
    Gogul Balakrishnan and Thomas Reps
 - Interprocedural Shape Analysis with Separated Heap Abstractions
    Alexey Gotsman, Josh Berdine and Byron Cook
 - Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm
    Alexey Loginov, Thomas Reps and Mooly Sagiv

 - Catching and Identifying Bugs in Register Allocation
    Yuqiang Huang, Bruce R. Childers and Mary Lou Soffa
 - Certificate Translation for Optimizing Compilers
    Gilles Barthe, Benjamin Gr챕goire, C챕sar Kunz and Tamara Rezk
 - Analysis of Low-Level Code Using Cooperating Decompilers
    Bor-Yuh Evan Chang, Matthew Harren and George C. Necula

 - Static Analysis for Java Servlets and JSP
    Christian Kirkegaard and Anders M첩ller
 - Cryptographically-Masked Flows
    Aslan Askarov, Daniel Hedin and Andrei Sabelfeld
 - Proving the Properties of Communicating Imperfectly-Clocked Synchronous
   Systems
    Julien Bertrane

 - Parametric and Termination-Sensitive Control Dependence
    Feng Chen and Grigore Rosu
 - Memory Leak Analysis by Contradiction
    Maksim Orlovich and Radu Rugina
 - Path-Sensitive Dataflow Analysis with Iterative Refinement
    Dinakar Dhurjati, Manuvir Das and Yue Yang

REGISTRATION FEE
 - Early regular USD 380, Early student USD 280
 - Late regular  USD 430, Late student  USD 330

************************************************************************