| WEDNESDAY 4/4 |
10.30
12.30 |
Language-Based Security
A Systematic Approach to Static Access Control
Francois Pottier (INRIA Rocquencourt),
Christian Skalka, Scott Smith
(John Hopkins University)
Secure Information Flow and CPS
Steve Zdancewic, Andrew C. Myers (Cornell University)
Enforcing Safety Properties Using Type Specialization
Peter Thiemann (Universität Freiburg)
Semantics and Program Analysis
of Computationally Secure Information Flow
Peeter Laud (Universität des Saarlandes)
|
17.30
19.00 |
Miscellaneous
Encoding Intensional Type Analysis
Stephanie Weirich (Cornell University)
Fusion on Languages
Roland Backhouse (University of Nottingham)
Programming the Web with High-Level Programming Languages
Paul Graunke (Rice University),
Shriram Krishnamurti (Brown
University),
Steve Van Der Hoeven (Université de Nice),
Matthias
Felleisen (Rice University)
|
| THURSDAY 5/4 |
10.30
12.30 |
Foundations of program Analysis and Verification
On the Completeness of Model Checking
Francesco Ranzato (Università di Padova)
Modal Transition Systems: a Foundation for Three-Valued Program
Analysis
Michael Huth (Kansas State University),
Radha Jagadeesan (Loyola University),
David Schmidt (Kansas State University)
Entailment with Conditional Equality Constraints
Zhendong Su, Alexander Aiken (University of California, Berkeley)
On the Complexity of Constant Propagation
Markus Müller-Olm, Oliver Rüthing (University of Dortmund)
|
15.00
17.00 |
Concurrency, Types and Analysis
What are Polymorphically-Typed Ambients?
Torben Amtoft, Assaf J. Kfoury, Santiago M. Pericas-Geertsen
(Boston University)
JOIN(X): Constraint-Based Type Inference for the Join-Calculus
Sylvain Conchon, Francois Pottier (INRIA Rocquencourt)
Modular Causality in a Synchronous Stream Language
Pascal Cuoq, Marc Pouzet (INRIA, Paris VI)
Control-Flow Analysis in Cubic Time
Flemming Nielson (Aarhus University),
Helmut Seidl (Universität Trier)
|
| FRIDAY 6/4 |
9.00
10.00 |
John Mitchell
(Invited lecture)
A Probabilistic Polynomial-time Process Calculus
for Security Protocol Analysis
|
10.30
12.30 |
Semantic Modelling
The Recursive Record Semantics of Objects Revisited
Gerard Boudol (INRIA Sophia Antipolis)
A Formalisation of Java's Exception Mechanism
Bart Jacobs (Nijmegen University)
A Formal Executable Semantics of the JavaCard Platform
G. Barthe, G. Dufay (INRIA, Sophia-Antipolis),
L. Jakubiec (INRIA,
Sophia-Antipolis and Université de Provence),
B. Serpette (INRIA,
Sophia-Antipolis),
S. Melo de Sousa (INRIA, Sophia-Antipolis and
Universidade da Beira Interior)
Modeling an Algebraic Stepper
John Clements, Matthew Flatt, Matthias Felleisen (Rice University)
|
15.00
17.00 |
Static Analysis
Typestate Checking of Machine Code
Zhichen Xu, Thomas Reps, Barton P. Miller (University of Wisconsin)
Proof-directed De-compilation of Low-level Code
Shin-ya Katsumata (University of Edinburgh),
Atsushi Ohori (Japan
Advanced Institute of Science and Technology)
Backwards Abstract Interpretation of Probabilistic Programs
David Monniaux (ENS, Paris)
Using Slicing to Identify Duplication in Source Code (DEMO)
Raghavan Komondoor, Susan Horwitz
(University of Wisconsin)
|
17.30
19.00 |
Logic Programming
Compiling Problem Specifications into SAT
Marco Cadoli (Università di Roma),
Andrea Schaerf (Università di Udine)
On the Semantics and Termination of Logic Programs with Dynamic
Scheduling
Annalisa Bossi (Università di Venezia),
Sandro Etalle (Universiteit
Maastricht and CWI Amsterdam),
Sabina Rossi (Università di Venezia),
Jan-Georg Smaus (CWI Amsterdam)
The Definite Approach to Dependency Analysis
Samir Genaim, Michael Codish (Ben-Gurion University)
|