Front matter
1-22
A Query Language Based on the Ambient Logic
Luca Cardelli and Giorgio Ghelli
23-29
Probabilistic Polynomial-Time Process Calculus and Security Protocol Analysis
John C. Mitchell
30-45
A Systematic Approach to Static Access Control
François Pottier, Christian Skalka and Scott Smith
46-61
Secure Information Flow and CPS
Steve Zdancewic and Andrew C. Myers
62-76
Enforcing Safety Properties Using Type Specialization
Peter Thiemann
77-91
Semantics and Program Analysis of Computationally Secure Information Flow
Peeter Laud
92-106
Encoding Intensional Type Analysis
Stephanie Weirich
107-121
Fusion on Languages
Roland Backhouse
122-136
Programming the Web with High-Level Programming Languages
Paul Graunke, Shriram Krishnamurthi, Steve Van Der Hoeven and Matthias Felleisen
137-154
On the Completeness of Model Checking
Francesco Ranzato
155-169
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
Michael Huth, Radha Jagadeesan and David Schmidt
170-189
Entailment with Conditional Equality Constraints
Zhendong Su and Alexander Aiken
190-205
On the Complexity of Constant Propagation
Markus Müller-Olm and Oliver Rüthing
206-220
What Are Polymorphically-Typed Ambients?
Torben Amtoft, Assaf J. Kfoury and Santiago M. Pericas-Geertsen
221-236
JOIN(X): Constraint-Based Type Inference for the Join-Calculus
Sylvain Conchon and François Pottier
237-251
Modular Causality in a Synchronous Stream Language
Pascal Cuoq and Marc Pouzet
252-268
Control-Flow Analysis in Cubic Time
Flemming Nielson and Helmut Seidl
269-283
The Recursive Record Semantics of Objects Revisited
Extended Abstract
Gérard Boudol
284-301
A Formalisation of Java’s Exception Mechanism
Bart Jacobs
302-319
A Formal Executable Semantics of the JavaCard Platform
Gilles Barthe, Guillaume Dufay, Line Jakubiec, Bernard Serpette and Simão Melo de Sousa
320-334
Modeling an Algebraic Stepper
John Clements, Matthew Flatt and Matthias Felleisen
335-351
Typestate Checking of Machine Code
Zhichen Xu, Thomas Reps and Barton P. Miller
352-366
Proof-Directed De-compilation of Low-Level Code
Shin-ya Katsumata and Atsushi Ohori
367-382
Backwards Abstract Interpretation of Probabilistic Programs
David Monniaux
383-386
Tool Demonstration: Finding Duplicated Code Using Program Dependences
Raghavan Komondoor and Susan Horwitz
387-401
Compiling Problem Specifications into SAT
Marco Cadoli1 and Andrea Schaerf
402-416
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling
Annalisa Bossi, Sandro Etalle, Sabina Rossi and Jan-Georg Smaus
417-431
The Def-inite Approach to Dependency Analysis
Samir Genaim and Michael Codish
Back matter