9:00-10:00
ETAPS invited Lecture

The Verifying Compiler: still a Grand Challenge for Computing Research
Tony Hoare (Microsoft Research, UK)
10:00-10:30
R E F R E S H M E N T S

10:30-12:30
CC: Optimization
  • Address Register Assignment for Reducing Code Size
    M. Kandemir, M. J. Irwin, G. Chen (Pennsylvania State University, USA),
    J. Ramanujam (Louisiana State University, USA)
  • Offset Assignment Showdown: Evaluation of DSP Address Code Optimization Algorithms
    Rainer Leupers (RWTH Aachen, D)
  • Integrating High-Level Optimizations in a Production Compiler: Design and Implementation Experience
    Somnath Ghosh, Abhay Kanhere, Rakesh Krishnaiyer, Dattatraya
    Kulkarni, Wei Li, Chu-Cheow Lim, John Ng (Intel Corporation, USA)
  • Improving Data Locality by Chunking
    Cédric Bastoul (Université de Versailles Saint Quentin, F),
    Paul Feautrier (École Normale Supérieure de Lyon, F)
10:30-12:30
FOSSACS: Logic and Verification
  • Cones and Foci for Protocol Verification Revisited
    Wan Fokkink (CWI and Vrije Universiteit Amsterdam, NL),
    Jun Pang (CWI, NL)
  • Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete
    Patrick Maier (Max-Planck-Institut für Informatik, D)
  • The Two-Variable Guarded Fragment with Transitive Guards is 2EXPTIME-Hard
    Emanuel Kieronski (University of Wroclaw, PL)
  • Verification of Cryptographic Protocols: Tagging Enforces Termination
    Bruno Blanchet (ENS Paris, F, and Max-Planck-Institut für Informatik, D),
    Andreas Podelski (Max-Planck-Institut für Informatik, D)
10:30-12:30
FASE: Software Components
  • An Ontology for Software Component Matching
    Claus Pahl (Dublin City University, IRL)
  • A Description Language For Composable Components
    Ioana Sora, Pierre Verbaeten, Yolande Berbers (Katholieke Universiteit Leuven, B)
  • A Logic Basis for the Specification of Reconfigurable Component-Based Systems
    Nazareno Aguirre, Tom Maibaum (King's College, London, UK)
  • An Overall System Design Approach doing Object-Oriented Modeling to Code-Generation for Embedded Electronic Systems
    Clemens Reichmann (University of Karlsruhe, D),
    Markus Kühl (Research Center for Information Technology, Karlsruhe, D),
    Klaus D. Müller-Glaser (University of Karlsruhe, D)
12:30-14:30
L U N C H   B R E A K

14.30 - 15.30
ETAPS invited lecture

Computer Security from a Programming Language and Static Analysis Perspective
Xavier Leroy (INRIA and Trusted Logic, F)
15.45 - 16.45
FOSSACS: Probabilistic Lossy Channels
  • Verification of Probabilistic Systems with Faulty Communication
    Parosh Aziz Abdulla (Uppsala University, S),
    Alexander Rabinovich (Tel Aviv University, IL)
  • Model Checking Lossy Channels Systems is Probably Decidable
    Nathalie Bertrand, Philippe Schnoebelen (ENS Cachan and CNRS, F)
15.45 - 16.45
TACAS: Security and Cryptography
  • A New Knowledge Representation Strategy for Cryptographic Protocol Analysis
    Ivan Cibrario Bertolotti, Luca Durante, Riccardo Sisto, Adriano Valenzano (Istituto di Elettronica e di Ingegneria dell'Informazione e delle Telecomunicazioni, I & Politecnico di Torino, I)
  • Pattern-based Abstraction for Verifying Secrecy in Protocols
    Liana Bozga, Lakhnech Yassine, Michael Perin (Verimag, F)
15.45 - 16.45
ESOP: Techniques & Methods
  • A Tail-Recursive Semantics for Stack Inspections
    John Clements, Matthias Felleisen (Northeastern University, USA)
  • Flexible Models for Dynamic Linking
    Sophia Drossopoulou (Imperial College, UK),
    Giovanni Lagorio (University of Genova, I),
    Susan Eisenbach (Imperial College, UK)
16.45 - 17.15
R E F R E S H M E N T S

17.15 - 18.45
FOSSACS: Recursion
  • Ambiguous Classes in the Games Mu-Calculus Hierarchy
    André Arnold, Luigi Santocanale (Université de Bordeaux, F)
  • On the Geometry of Inductive Reasoning: Circular and Tree-Shaped Proofs in the Mu-Calculus
    Christoph Sprenger (Swedish Institute of Computer Science, S),
    Mads Dam (Royal Institute of Technology, S)
  • Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time
    Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois,
    Jean-Yves Marion (LORIA/INRIA, F)
17.15 - 18.45
ESOP: Logic Programming
  • Automated Correction of Functional Logic Programs
    Maria Alpuente (Univ. Politecnica de Valencia, E),
    Demis Ballis (Università di Udine, I),
    Francisco Correa (Univ. Eafit, CO),
    Moreno Falaschi (Università di Udine, I)
  • Approximate Pruning in Tabled Logic Programming
    Luis F. Castro, David S. Warren (SUNY at Stony Brook, USA)
  • Goal-Independent Suspension Analysis of Logic Programs with Dynamic Scheduling
    Samir Genaim (Ben-Gurion University of the Negev, IL),
    Andy King (University of Kent at Canterbury, UK)
17.15 - 18.45
FASE: Mobile Computing
  • Composing Specifications of Event Based Applications?
    Pascal Fenkam, Harald Gall, Mehdi Jazayeri (Technical University of Vienna, A)
  • A Spatio-Temporal Logic for the Specification and Refinement of Mobile Systems
    Stephan Merz (INRIA Lorraine, F), Martin Wirsing, Julia Zappe (Universität München, D)
  • Spatial Security Policies for Mobile Agents in a Sentient Computing Environment
    David Scott, Alastair Beresford, Alan Mycroft (University of Cambridge,UK)
Evening
C O N F E R E N C E  D I N N E R