FoSSaCS 2009

Accepted Papers

• Samy Abbes and Albert Benveniste. Concurrency, sigma-algebras and probabilistic fairness.
• Markus Lohrey, Sebastian Maneth and Manfred Schmidt-Schauss. Parameter Reduction in Grammar-Compressed Trees.
• Jiri Adamek, Stefan Milius and Jiri Velebil. A Description of Iterative Reflections of Monads.
• etienne lozes, Remi Brochenin and Kshitij Bansal. Beyond Shapes: Lists with Ordered Data.
• Joshua Guttman. Cryptographic Protocol Composition via the Authentication Tests.
• Timos Antonopoulos and Anuj Dawar. Separating Graph Logic from MSO.
• Richard Mayr and Parosh Abdulla. Minimal Cost Reachability/Coverability in Priced Timed Petri Nets.
• Christopher Broadbent and Luke Ong. On Global Model Checking Trees Generated by Higher-Order Recursion Schemes.
• Luca Fossati and Daniele Varacca. The Calculus of Handshake Configurations.
• Julian Gutierrez. Logical characterization of Concurrency, Causality and Conflict.
• Daniel Leivant. The completeness of first-order dynamic logic.
• Lars Birkedal, Kristian Støvring and Jacob Thamsborg. Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types.
• Sergueï Lenglet, Alan Schmitt and Jean-Bernard Stefani. Normal Bisimulations in Calculi with Passivation.
• Andrzej Murawski and Nikos Tzevelekos. Full Abstraction for Reduced ML.
• Marcello Bonsangue, jan rutten and Alexandra Silva. A Kleene Theorem for Polynomial Coalgebras.
• Colin Stirling. Dependency Tree Automata.
• Martin R. Neuhäußer, Marielle Stoelinga and Joost-Pieter Katoen. Delayed Nondeterminism in Continuous-Time Markov Decision Processes.
• Beatrice Berard and Serge Haddad. Interrupt Timed Automata.
• Filippo Bonchi, Fabio Gadducci and Giacoma Monreale. Reactive Systems, Barbed Semantics, and the Mobile Ambients.
• Pierre Clairambault. Least and Greatest Fixpoints in Game Semantics.
• Benedikt Bollig, Manuela-Lidia Grindei and Peter Habermehl. Realizability of Concurrent Recursive Programs.
• Sven Schewe. Tighter Bounds for the Determinization of Buchi Automata.
• Robert Myers, Dirk Pattinson and Lutz Schröder. Coalgebraic Hybrid Logic.
• Geoffrey Smith. On the Foundations of Quantitative Information Flow.
• Konstantinos Chatzikokolakis, Gethin Norman and David Parker. Bisimulation for demonic schedulers.
• Orna Kupferman and Nir Piterman. Lower Bounds on Witnesses for Nonemptiness of Universal co-Büchi Automata.
• Gera Weiss, Aldric Degorre, Rajeev Alur and Oded Maler. Accumulation Points of Multidimensional Mean-Payoff for Language Specification.
• Yoad Lustig and Moshe Y. Vardi. Synthesis from Component Libraries.
• Frank Valencia, Jesus Aranda and Cristian Versari. On the Expressiveness of Restriction in CCS with Replication..
• Stefan Kiefer, Morten Kühnrich, Stefan Schwoon and Jiri Srba. Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains.