C. Aiswarya, Benedikt Bollig and Paul Gastin. An Automata-Theoretic Approach to the Verification of Distributed Algorithms

Sergueï Lenglet and Alan Schmitt. Howe's Method for Contextual Semantics

Dimitrios Kouzapas, Jorge A. Pérez and Nobuko Yoshida. Characteristic Bisimulations for Higher-Order Session Processes

Salvatore La Torre, Anca Muscholl and Igor Walukiewicz. Safety of parametrized asynchronous shared-memory systems is almost always decidable

Marco Carbone, Fabrizio Montesi, Nobuko Yoshida and Carsten Schurmann. Multiparty Session Types as Coherence Proofs

Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas and Tjark Weber. Modal Logics for Nominal Transition Systems

Laura Bocchi, Julien Lange and Nobuko Yoshida. Meeting Deadlines Together

Paul Hunter, Guillermo Perez and Jean-Francois Raskin. Reactive Synthesis Without Regret

David Harel, Guy Katz, Robby Lampert, Assaf Marron and Gera Weiss. On the Succinctness of Idioms for Concurrent Programming

Cesar Rodriguez, Marcelo Sousa, Subodh Sharma and Daniel Kroening. Unfolding-based Partial Order Reduction

Shaull Almagor, Guy Avni and Orna Kupferman. Repairing Multi-Player Games

Fu Song. On Reachability Analysis of Pushdown Systems with Transductions: Application to Boolean Programs with Call-by-Reference

Luca Cardelli, Mirco Tribastone, Max Tschaikowski and Andrea Vandin. Forward and Backward Bisimulations for Chemical Reaction Networks

Andrea Cerone, Giovanni Bernardi and Alexey Gotsman. A Framework for Transactional Consistency Models with Atomic Visibility

Eike Best and Raymond Devillers. Synthesis of Bounded Choice-Free Petri Nets

Yuan Feng and Mingsheng Ying. Toward automatic verification of quantum cryptographic protocols

Sadegh Soudjani, Rupak Majumdar and Alessandro Abate. Dynamic Bayesian Networks as Formal Abstractions of Structured Stochastic Processes

Julian Gutierrez, Paul Harrenstein and Michael Wooldridge. Expressiveness and Complexity Results for Strategic Reasoning

Taolue Chen, Fu Song and Zhilin Wu. On the Satisfiability of Indexed Linear Temporal Logics

Patricia Bouyer, Samy Jaziri and Nicolas Markey. On the Value Problem in Weighted Timed Games

Daniel Gebler and Simone Tini. SOS Specifications of Probabilistic Systems by continuous operators

Yuxin Deng, Yuan Feng and Ugo Dal Lago. On Coinduction and Quantum Lambda Calculi

Dana Fisman and Yoad Lustig. A Modular Approach for Büchi Determinization

Ivan Gavran, Filip Niksic, Aditya Kanade, Rupak Majumdar and Viktor Vafeiadis. Rely/Guarantee Reasoning for Asynchronous Programs

Filippo Bonchi, Daniela Petrisan, Damien Pous and Jurriaan Rot. Lax Bialgebras and Up-To Techniques for Weak Bisimulations

David Baelde, Stephanie Delaune and Lucca Hirschi. Partial Order Reduction for Security Protocols

Javier Esparza, Pierre Ganty, Jérôme Leroux and Rupak Majumdar. Verification of Population Protocols

Vojtech Forejt and Jan Krcal. On Frequency LTL in Probabilistic Systems

Ernst Moritz Hahn, Guangyuan Li, Sven Schewe, Andrea Turrini and Lijun Zhang. Lazy Probabilistic Model Checking without Determinisation

Romain Brenguier, Jean-Francois Raskin and Ocan Sankur. Assume-Admissible Synthesis

Jan Kretinsky, Kim G. Larsen, Simon Laursen and Jiri Srba. Polynomial Time Decidability of Weighted Synchronization under Partial Observability

Nathalie Bertrand, Paulin Fournier and Arnaud Sangnier. Distributed local strategies in broadcast networks

Thomas Brihaye, Gilles Geeraerts, Axel Haddad and Benjamin Monmege. To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games