Programme of FOSSACS at ETAPS 2008

Foundations of Software Science and Computation Structures

Programme of Wednesday, April 2

09:00 - 10:00 SESSION 1 (Wednesday)

Unifying Invited Talk (room: Europa)
Verification of higher-order computation: a game-semantic approach
Luke Ong

10:00 - 10:30 Coffee

10:30 - 12:30 SESSION 2 (FOSSACS, Wednesday)

GAMES (room: Star)
Simple Stochastic Games with Few Random Vertices are Easy to Solve
Hugo Gimbert (LABRI, Bordeaux) and Florian Horn (Paris 7 University)
The Complexity of Nash Equilibria in Infinite Multiplayer Games
Michael Ummels (RWTH, Aachen)
Stochastic Games with Lossy Channels
Noomene Ben Henda, Parosh Abdulla (Uppsala University) Richard Mayr (North Carolina State University) Luca de Alfaro (University of California at Santa Cruz) and Sven Sandberg (Uppsala University)
Simulation Hemi-Metrics Between Infinite-State Stochastic Games
Jean Goubault-Larrecq (ENS, Cachan)

12:30 - 14:30 Lunch

14:15 - 15:15 SESSION 3A (Wednesday)

Unifying Invited Talk (room: Europa)
WYSINWYX: What You See Is Not What You eXecute
Tom Reps

15:30 - 16:30 SESSION 3B (FOSSACS, Wednesday)

ALGEBRAIC MODELS I (room: Magnolia)
Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics
Dirk Pattinson (Imperial College, London) and Lutz Schroeder (Bremen University)
Linear-non-linear model for a computational call-by-value lambda calculus
Benoit Valiron (University of Ottawa) and Peter Selinger (Dalhousie University)
The Omega-Regular Post Embedding Problem
Pierre Chambart and Philippe Schnoebelen (ENS, Cachan)
Complexity of decision problems for mixed and modal specifications
Adam Antonik, Michael Huth (Imperial College, London) Kim G. Larsen, Ulrik Nyman and Andrzej Wasowski (Aalborg University)

16:30 - 17:00 Coffee

17:00 - 18:30 SESSION 4 (FOSSACS, Wednesday)

Classes of Tree Homomorphisms with Decidable Preservation of Regularity
Guillem Godoy (Technical University Catalonia) Sebastian Maneth (New South Wales University) and Sophie Tison (Lille 1 University)
A Kleene-Schūtzenberger Theorem for Weighted Timed Automata
Manfred Droste and Karin Quaas (Leipzig University)
Robust Analysis of Timed Automata via Channel Machines
Patricia Bouyer (Oxford University), Nicolas Markey (ENS Cachan) and Pierre-Alain Reynier (Brussels Free University)

Programme of Thursday, April 3

10:30 - 12:30 SESSION 2 (FOSSACS, Thursday)

LOGICS (room: Magnolia)
The common fragment of ACTL and LTL
Mikolaj Bojanczyk (Warsaw University)
The complexity of CTL* + linear past
Laura Bozzelli (Naples University)
Footprints in Local Reasoning
Mohammad Raza and Philippa Gardner (Imperial College, London)
A Modal Deconstruction of Access Control Logics
Deepak Garg (CMU, Pittsburgh) and Martin Abadi (University of California at Santa Cruz and Microsoft Research)

12:30 - 14:30 Lunch

14:15 - 15:15 SESSION 3A (FOSSACS, Thursday)

Invited Talk (room: Europa)
Finding your way in a forest: on different types of trees and their properties
Igor Walukiewicz

15:30 - 16:30 SESSION 3B (FOSSACS, Thursday)

ALGEBRAIC MODELS II (room: Magnolia)
Coalgebraic Logic and Synthesis of Mealy Machines
Alexandra Silva (CWI, Amsterdam) Marcello Bonsangue (Leiden Univ.) and Jan Rutten (CWI, Amsterdam)
The Microcosm Principle and Concurrency in Coalgebra
Ichiro Hasuo, Bart Jacobs (Radboud University, Nijmegen) and Ana Sokolova (Salzburg University)
Systems of Equations Satisfied in All Commutative Finite Semigroups
Pawel Parys (Warsaw University)
Optimal Lower Bounds on Regular Expression Size using Communication Complexity
Hermann Gruber and Jan Johannsen (LMU University, Munich)

16:30 - 17:00 Coffee

17:00 - 18:30 SESSION 4 (FOSSACS, Thursday)

On Decision Problems for Probabilistic Buechi Automata
Christel Baier (Dresden Technical University) Nathalie Bertrand (IRISA, Rennes) and Marcus Groesser (Dresden Technical University)
Model-Checking ω-Regular Properties of Interval Markov Chain
Krishnendu Chatterjee, Koushik Sen (University of California at Berkeley) and Thomas Henzinger (EPFL, Lausanne)
Prevision Domains and Convex Powercones
Jean Goubault-Larrecq (ENS, Cachan)

Programme of Friday, April 4

10:30 - 12:30 SESSION 2 (FOSSACS, Friday)

RPO, Second Order Contexts, and lambda-calculus
Pietro Di Gianantonio, Furio Honsell and Marina Lenisa (Udine University)
An Erasure Semantics for Pure Type Systems
Nathan Mishra Linger and Tim Sheard (Portland State University)
The Implicit Calculus of Constructions as a Programming Language with Dependent Types
Bruno Barras and Bruno Bernardo (INRIA, Palaiseau)
Strong Normalisation of Cut-Elimination that Simulates Beta-Reduction
Kentaro Kikuchi (Tohoku University) and Stephane Lengrand (CNRS, Palaiseau)

12:30 - 14:30 Lunch

14:30 - 16:30 SESSION 3 (FOSSACS, Friday)

Symbolic Semantics Revisited
Filippo Bonchi and Ugo Montanari (Pisa University)
Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
Guilherme Rangel (Berlin Technical University) Barbara Koenig (Duisburg-Essen University) and Hartmut Ehrig (Berlin Technical University)
Structural operational semantics for stochastic process calculi
Bartek Klin (Edinburgh University) and Vladimiro Sassone (Southampton University)
Compositional Methods for Information-Hiding
Christelle Braun, Konstantinos Chatzikokolakis and Catuscia Palamidessi (INRIA, Palaiseau)

16:30 - 17:00 Coffee

17:00 - 18:30 SESSION 4 (FOSSACS, Friday)

Products of Message Sequence Charts
Philippe Darondeau, Blaise Genest and Loic Helouet (IRISA, Rennes)
What else is decidable about arrays?
Radu Iosif (CNRS, Grenoble), Peter Habermehl (ENS, Cachan) and Tomas Vojnar (Brno Technical University)
Model checking freeze LTL over one-counter automata
Stephane Demri (ENS, Cachan) Ranko Lazic (Warwick University) and Arnaud Sangnier (ENS, Cachan)

Detailed Programme Information:

ETAPS 2008 | Top | HTML 4.01 | Last Update: 2007-12-27