| Tuesday, April 8th |
| 10h30 - 12h30 |
FOSSACS / Room: Makalu
Probabilistic systems (chair: Holger Hermanns)
- Nathalie Bertrand, Eric Fabre, Stefan Haar, Serge Haddad and Loic Helouet. Active diagnosis for probabilistic systems
- Remi Bonnet, Stefan Kiefer and Anthony Widjaja Lin. Analysis of Probabilistic Basic Parallel Processes
- Laurent Doyen, Thierry Massart and Mahsa Shirmohammadi. Limit Synchronization in Markov Decision Processes
- Hongfei Fu. Maximal Cost-Bounded Reachability Probability on Continuous-Time Markov Decision Processes
|
| 15h00 - 16h00 |
FOSSACS / Room: Makalu
Semantics of programming languages (chair: Simona Ronchi della Rocca)
- Luca Padovani. Type Reconstruction for the Linear pi-Calculus with Composite and Equi-Recursive Types (nomination for best paper award)
- Alberto Carraro and Giulio Guerrieri. A semantical and operational account of call-by-value solvability
|
| Wednesday, April 9th |
| 15h00 - 16h00 |
FOSSACS / Room: Makalu
Networks (chair: Anca Muscholl)
- Guy Avni, Orna Kupferman and Tami Tamir. Network-Formation Games with Regular Objectives
- Nathalie Bertrand, Paulin Fournier and Arnaud Sangnier. Playing with probabilities in Reconfigurable Broadcast Networks
|
| 16h30 - 18h00 |
FOSSACS / Room: Makalu
Program analysis (chair: Paul-André Melliès)
- Naoki Kobayashi, Kazuhiro Inaba and Takeshi Tsukada. Unsafe Order-2 Tree Languages are Context-Sensitive (nomination for best paper award)
- Andrzej Murawski and Nikos Tzevelekos. Game semantics for nominal exceptions
- Takeshi Tsukada and Naoki Kobayashi. Complexity of Model-Checking Call-by-Value Programs
|
| Thursday, April 10th |
| 10h30 - 12h30 |
FOSSACS / Room: Makalu
Games and synthesis (chair: Bernd Finkbeiner)
- Martin Lang. Resource Reachability Games on Pushdown Graphs
- Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert and Youssouf Oualhadj. Perfect-Information Stochastic Mean-Payoff Parity Games
- Shaull Almagor and Orna Kupferman. Latticed-LTL Synthesis in the Presence of Noisy Inputs
- Krishnendu Chatterjee, Laurent Doyen, Sumit Nain and Moshe Y. Vardi. The Complexity of Partial-observation Stochastic Parity Games With Finite-memory Strategies
|
| 15h00 - 16h00 |
FOSSACS / Room: Makalu
Compositional reasoning (chair: Krishnendu Chatterjee)
- Javier Esparza and Jörg Desel. On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations
- Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Catherine Meadows, Paliath Narendran and Christophe Ringeissen. On Asymmetric Unification and the Combination Problem in Disjoint Theories
|
| Friday, April 11th |
| 09h00 - 10h00 |
Room: Amphitheater
FOSSACS Invited Speaker
Petr Jancar (Technical Univ of Ostrava, Czech Republic)
Equivalences of Pushdown Systems are Hard |
| 10h30 - 12h30 |
FOSSACS / Room: Makalu
Bisimulation (chair: Philippe Schnoebelen)
- Pedro R. D'Argenio, Daniel Gebler and Matias David Lee. Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules
- James Ferlez, Rance Cleaveland and Steve Marcus. Generalized Synchronization Trees
- Vasileios Koutavas, Carlo Spaccasassi and Matthew Hennessy. Bisimulations for Communicating Transactions (Extended Abstract)
- Matteo Mio. Upper-Expectation Bisimilarity and Lukasiewicz mu-Calculus
|
| 14h00 - 16h00 |
FOSSACS / Room: Makalu
Categorical and algebraic models (chair: Shin-ya Katsumata)
- Filippo Bonchi, Pawel Sobocinski and Fabio Zanasi. Interacting Bialgebras are Frobenius
- Robert Myers, Jiri Adamek, Stefan Milius and Henning Urbat. Generalized Eilenberg Theorem I: Local Varieties of Languages
- Jurriaan Rot and Marcello Bonsangue. Combining Bialgebraic Semantics and Equations
- Guillaume Munch-Maccagnoni. Models of a Non-Associative Composition
|
| 16h30 - 18h00 |
FOSSACS / Room: Makalu
Logics of programming (chair: Anca Muscholl)
- Timos Antonopoulos, Nikos Gorogiannis, Christoph Haase, Max Kanovich and Joel Ouaknine. Foundations for Decision Problems in Separation Logic with General Inductive Predicates
- Corina Cirstea. A Coalgebraic Approach to Linear-Time Logics
- Till Mossakowski and Andrzej Tarlecki. A relatively complete calculus for structured heterogeneous specifications
|