An Intrinsic Characterization of Approximate Probabilistic Bisimilarity
Franck van Breugel (York University, CDN),
Michael Mislove (Tulane University, USA),
Joël Ouaknine (Carnegie Mellon University, USA),
James Worrell (Tulane University, USA).
The Converse of a Stochastic Relation
Ernst-Erich Doberkat (University of Dortmund, D)
Parameterized Verification by Probabilistic Abstraction
Tamarah Arons, Amir Pnueli (Weizmann Institute of Science, IL),
Lenore Zuck (New York University, USA).
12.30 - 14.30:
LUNCH
14.30 - 16.00:
FOSSACS: Process Calculi
Session chair: Uwe Nestmann
Towards a Behavioural Theory of Access and Mobility Control in
Distributed Systems
Matthew Hennessy, Massimo Merro, Julian Rathke (University of
Sussex, UK)
When Ambients Cannot be Opened
Iovka Boneva, Jean-Marc Talbot (Laboratoire d'Informatique
Fondamentale de Lille, F)
Genericity and the Pi-Calculus
Martin Berger, Kohei Honda (Queen Mary, University of London, UK)
Nobuko Yoshida (Imperial College, UK)
Deriving Bisimulation Congruences: 2-categories vs Precategories
Vladimiro Sassone (University of Sussex, UK),
Pawel Sobocinski (University of Aarhus, DK)
Abstraction in Reasoning about Higraph-based Systems
John Power, Konstantinos Tourlas (University of Edinburgh, UK)
Categories of Containers
Michael Abbott (Leicester University, UK),
Thorsten Altenkirch (Nottingham University, UK),
Neil Ghani (Leicester University, UK)
Tuesday, April 8:
10.30 - 12.30:
FOSSACS: Syntax and Semantics of Programming Languages
Session chair: Andrew Gordon
Multi-Level Meta-Reasoning with Higher-Order Abstract Syntax
Alberto Momigliano, Simon Ambler (University of Leicester, UK)
A Normalisation Result for Higher-Order Calculi with Explicit
Substitutions
Eduardo Bonelli (Universidad Nacional de La Plata, RA, and Stevens
Institute of Technology, USA)
A Game Semantics of Linearly Used Continuations
James Laird (University of Sussex, UK)
A Monadic Multi-stage Metalanguage
Eugenio Moggi, Sonia Fagorzi (University of Genova, I)
12.30 - 14.30:
LUNCH
14.30 - 16.30:
FOSSACS: From Trees to Types
Session chair: Eugenio Moggi
Counting and Equality Constraints for Multitree Automata
Denis Lugiez (CNRS and Université de Provence, F)
Manipulating Trees with Hidden Labels
Luca Cardelli (Microsoft Research, UK)
Philippa Gardner (Imperial College, UK)
Giorgio Ghelli (Università di Pisa, I)
Type Assignment for Intersections and Unions in Call-by-Value Languages
Joshua Dunfield, Frank Pfenning (Carnegie Mellon University, USA)
Generalized Iteration and Coiteration for Higher-Order Nested Datatypes
Andreas Abel (University of Munich, D)
Ralph Matthes (Université de Paris VII, F, and University of Munich, D)
Tarmo Uustalu (Tallinn Technical University, EST)
Wednesday, April 9:
10.30 - 12.30:
FOSSACS: Logic and Verification
Session chair: Witold Charatonik
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)
15.45 - 16.45:
FOSSACS: Probabilistic Lossy Channels
Session chair: Igor Walukiewicz
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)
16.45 - 17.15:
coffee
17.15 - 18.45:
FOSSACS: Recursion
Session chair: Igor Walukiewicz
Ambiguous Classes in the Games Mu-Calculus Hierarchy
André Arnold, Luigi Santocanale (Université de Bordeaux, F)
On the Structure of Inductive Reasoning:
Circular and Tree-Shaped Proofs in the Mu-Calculus
Christoph Sprenger (INRIA Sophia Antipolis, F),
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)