Conference Programme (Download )

Jane Hillston. The Benefits of Sometimes Not Being Discrete (invited - joint with IFIP-TCS)

PROCESS CALCULI

• Marco Carbone, Fabrizio Montesi and Carsten Schuermann. Choreographies, Logically
• Elena Giachino, Naoki Kobayashi and Cosimo Laneve. Deadlock analysis of unbounded process networks
• Davide Sangiorgi and Xian Xu. Trees from Functions as Processes
• Jean-Marie Madiot, Damien Pous and Davide Sangiorgi. Bisimulations up-to: beyond first-order transition systems

MODEL CHECKING AND ABSTRACTION

• Benjamin Aminof, Tomer Kotek, Sasha Rubin, Francesco Spegni and Helmut Veith. Parameterized Model Checking of Rendezvous Systems
• Igor Konnov, Helmut Veith and Josef Widder. On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability
• Alexander Kaiser, Daniel Kroening and Thomas Wahl. Lost in Abstraction: Monotonicity in Multi-Threaded Programs

SYNTHESIS

• Guy Avni and Orna Kupferman. Synthesis from Component Libraries with Costs
• Nicolas Basset, Marta Kwiatkowska and Clemens Wiltsche. Compositional Controller Synthesis for Stochastic Games
• Simon Laursen, Kim Guldstrand Larsen and Jiri Srba. Synchronizing Strategies under Partial Observability
• Youssouf Oualhadj, Pierre-Alain Reynier and Ocan Sankur. Probabilistic Robust Timed Games

Javier Esparza. Deterministic negotiations: Concurrency for free (invited)

QUANTITATIVE MODELS

• Taolue Chen, Yuan Feng, David Rosenblum and Guoxin Su. Perturbation Analysis in Verification of Discrete-Time Markov Chains
• Laurent Doyen, Thierry Massart and Mahsa Shirmohammadi. Robust Synchronization in Markov Decision Processes
• Holger Hermanns, Jan Krcal and Jan Kretinsky. Probabilistic Bisimulation: Naturally on Distributions
• Patricia Bouyer, Nicolas Markey and Raj Mohan Matteplackel. Averaging in LTL

Vasco Vasconcelos. The Progress of Session Types (invited)

AUTOMATA AND MULTITHREADING

• Lorenzo Clemente, Frédéric Herbreteau and Grégoire Sutre. Decidable Topologies for Communicating Automata with FIFO and Bag Channels
• C. Aiswarya, Paul Gastin and K. Narayan Kumar. Controllers for the Verification of Communicating Multi-Pushdown Systems
• Kazuhide Yasukata, Naoki Kobayashi and Kazutaka Matsuda. Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking

COMPLEXITY

• Anthony Widjaja Lin and Sanming Zhou. A linear-time algorithm for the orbit problem over cyclic groups
• Yuan Feng and Lijun Zhang. A Nearly Optimal Upper Bound for the Self-Stabilization Time in Herman's Algorithm
• Reiner Hüchting, Rupak Majumdar and Roland Meyer. Bounds on Mobility

PROCESS CALCULI AND TYPES

• Rémy Chrétien, Veronique Cortier and Stephanie Delaune. Typing messages for free in security protocols: the case of equivalence properties
• Giovanni Bernardi and Matthew Hennessy. Using higher-order contracts to model session types (Extended abstract)
• Massimo Bartoletti, Alceste Scalas and Roberto Zunino. A semantic deconstruction of session types
• Laura Bocchi, Weizhen Yang and Nobuko Yoshida. Timed Multiparty Session Types

Catuscia Palamidessi. Generalized bisimulation metrics (invited - joint with TGC)

CATEGORIES, GRAPHS AND QUANTUM SYSTEMS

• Filippo Bonchi, Pawel Sobocinski and Fabio Zanasi. A Categorical Semantics of Signal Flow Graphs
• Natsuki Urabe and Ichiro Hasuo. Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices
• Barbara Koenig and Jan Stueckrath. A General Framework for Well-Structured Graph Transformation Systems
• Yangjia Li and Mingsheng Ying. (Un)decidable Problems about Reachability of Quantum Systems

AUTOMATA AND TIME

• Normann Decker, Peter Habermehl, Martin Leucker and Daniel Thoma. Ordered Navigation on Multi-attributed Data Words
• Karin Quaas. Verification for Timed Automata extended with Unbounded Discrete Data Structure
• Shibashis Guha, Chinmay Narayan and S. Arun-Kumar. Reducing Clocks in Timed Automata while Preserving Bisimulation

GAMES

• Krishnendu Chatterjee. Qualitative Concurrent Parity Games: Bounded Rationality
• Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege and Ashutosh Trivedi. Adding Negative Prices to Priced Timed Games (synthesis)
• Falak Sher and Joost-Pieter Katoen. Tight Game Abstractions of Probabilistic Automata