Organized by
Universidad de Buenos Aires and
Universidad Nacional de Córdoba

Accepted Papers

Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier and Jeremy Sproston. Solving Parity Games on Integer Vectors
Shoham Ben-David, Marsha Chechik and Sebastian Uchitel. Merging Partial Behaviour Models with Different Vocabularies
Nikola Benes, Benoit Delahaye, Uli Fahrenberg, Jan Kretinsky and Axel Legay. Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory
Giovanni Bernardi and Matthew Hennessy. Mutually testing processes
Xiaojuan Cai and Mizuhito Ogawa. Well-Structured Pushdown Systems
Claudia Carapelle, Alexander Kartzow and Markus Lohrey. Satisfiability of CTL^* with constraints
Krishnendu Chatterjee and Yaron Velner. Hyperplane Separation Technique for Multidimensional Mean-Payoff Games
Martin Churchill, Peter Mosses and Mohammadreza Mousavi. Modular Semantics for Transition System Specifications with Negative Premises
Sjoerd Cranen, Tim Willemse and Bas Luttik. Proof graphs for parameterized Boolean equation systems
Vincent Danos, Russ Harmer and Ricardo Honorato-Zimmer. Thermodynamic graph-rewriting
Andrei Dorman and Damiano Mazza. A Hierarchy of Expressiveness in Concurrent Interaction Nets
Vijay D'Silva. A Generalization of Simulation to Abstract Domains
Javier Esparza and Jörg Desel. On Negotiation as Concurrency Primitive
Klaus von Gleissenthall and Andrey Rybalchenko. An Epistemic Perspective on Consistency of Concurrent Computations
Julian Gutierrez and Glynn Winskel. Borel Determinacy of Concurrent Games
Christoph Haase, Sylvain Schmitz and Philippe Schnoebelen. The Power of Priority Channel Systems
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen and Peter Bro Miltersen. A Faster Algorithm for Solving One-Clock Priced Timed Games
Thomas Henzinger and Jan Otop. From Model Checking to Model Measuring
Thomas Henzinger, Ali Sezgin and Viktor Vafeiadis. Aspect-oriented linearizability proofs
Holger Hermanns, Jan Krcal and Jan Kretinsky. Compositional Verification and Optimization of Interactive Markov Chains
Holger Hermanns and Andrea Turrini. Cost Preserving Bisimulations for Probabilistic Automata
Reiner Hüchting, Rupak Majumdar and Roland Meyer. A Theory of Name Boundedness
Jonathan Kochems and Luke Ong. Safety Verification of Asynchronous Pushdown Systems with Shaped Stacks
Vasileios Koutavas and Matthew Hennessy. Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation
Dimitrios Kouzapas and Nobuko Yoshida. Globally Governed Session Semantics
Andrey Kupriyanov and Bernd Finkbeiner. Causality-based Verification of Multi-threaded Programs
Jerome Leroux, M. Praveen and Grégoire Sutre. A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness
Hongjin Liang, Jan Hoffmann, Xinyu Feng and Zhong Shao. Observing Progress Properties via Contextual Refinements
Rupak Majumdar and Zilong Wang. Expand, Enlarge, and Check for Branching Vector Addition Systems
Fabrizio Montesi and Nobuko Yoshida. Compositional Choreographies
Vivek Nigam, Carlos Olarte and Elaine Pimentel. A General Proof System for Modalities in Concurrent Constraint Programming
Iain Phillips and Irek Ulidowski. Reversibility and Asymmetric Conflict in Event Structures
Ocan Sankur, Patricia Bouyer, Nicolas Markey and Pierre-Alain Reynier. Robust Controller Synthesis in Timed Automata
Shenggang Ying, Yuan Feng, Nengkun Yu and Mingsheng Ying. Reachability Probabilities of Quantum Markov Chains