List of accepted papers

« back to program

  • Linear Time Logics around PSL: Complexity, Expressiveness, and a little bit of Succinctness

    Martin Lange

  • Compositional Event Structure Semantics for the Internal pi-calculus

    Silvia Crafa, Daniele Varacca and Nobuko Yoshida

  • Asynchronous Games: Innocence without Alternation

    Paul-André Melliès and Samuel Mimram

  • Temporal Antecedent Failure: Refining Vacuity

    Shoham Ben-David, Dana Fisman and Sitvanit Ruah

  • Strategy Logic

    Krishnendu Chatterjee, Thomas A. Henzinger and Nir Piterman

  • Topology-dependent Abstractions of Broadcast Networks

    Sebastian Nanz, Flemming Nielson and Hanne Riis Nielson

  • Reactive Systems over Directed Bigraphs

    Davide Grohmann and Marino Miculan

  • Coalgebraic Models for Reactive Systems

    Filippo Bonchi and Ugo Montanari

  • A Marriage of Rely/Guarantee and Separation Logic

    Viktor Vafeiadis and Matthew Parkinson

  • Mobility Control via Passports

    Samuel Hym

  • A Nice Labelling for Tree-Like Event Structures of Degree 3

    Luigi Santocanale

  • On Modal Refinements and Consistency

    Kim G. Larsen, Ulrik Nyman and Andrzej Wasowski

  • Equivalence Checking for Infinite Systems using Parameterized Boolean Equation Systems

    Taolue Chen, Bas Ploeger, Jaco van de Pol and Tim Willemse

  • Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures

    Peter Lammich and Markus Müller-Olm

  • Interpreting a Finitary Pi-Calculus in Differential Interaction Nets

    Thomas Ehrhard and Olivier Laurent

  • Automatic Derivation of Compositional Rules in Automated Compositional Reasoning

    Bow-Yaw Wang

  • Fair Cooperative Multithreading, or Typing Termination in a Higher-Order Concurrent Imperative Language

    Gérard Boudol

  • The must preorder revisited, an algebraic theory for Web services contracts

    Cosimo Laneve and Luca Padovani

  • Is Observational Congruence Axiomatisable in Equational Horn Logic?

    Michael Mendler and Gerald Luettgen

  • Strategy Synthesis for Markov Decision Processes and Branching-Time Logics

    Tomáš Brázdil and Vojtech Forejt

  • Causal Message Sequence Charts

    Thomas Gazagnaire, Blaise Genest, Loïc Hélouët, P S Thiagarajan and Shaofa Yang

  • On the Expressive Power of Global and Local Priority in Process Calculi

    Cristian Versari, Nadia Busi and Roberto Gorrieri

  • Checking Coverage for Infinite Collections of Timed Scenarios

    S. Akshay, Madhavan Mukund and K. Narayan Kumar

  • Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages

    Laura Bozzelli

  • Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes

    Martin R Neuhäußer and Joost-Pieter Katoen

  • Timed Concurrent Game Structures

    Thomas Brihaye, François Laroussinie, Nicolas Markey and Ghassan Oreiby

  • Pushdown Module Checking with Imperfect Information

    Benjamin Aminof, Aniello Murano and Moshe Y. Vardi

  • Solving Games via Three-Valued Abstraction Refinement

    Luca de Alfaro and Pritam Roy

  • Decidability Results for Well-Structured Transition Systems with Auxiliary Storage

    R. Chadha and M. Viswanathan

  • Making Random Choices Invisible to the Scheduler

    Konstantinos Chatzikokolakis and Catuscia Palamidessi