Accepted Papers


  • Rocco De Nicola, Tan Duong, Omar Inverso and Catia Trubiani.
    AErlang: empowering Erlang with attribute-based communication
  • Marco Krauweel and Sung-Shik T.Q. Jongmans.
    Simpler Coordination of JavaScript Web Workers
  • Giorgio Audrito, Ferruccio Damiani and Mirko Viroli.
    Optimally-Self-Healing Distributed Gradient Structures through Bounded Information Speed
  • Keigo Imai, Nobuko Yoshida and Shoji Yuen.
    Session-ocaml: a session-based library with polarities and lenses
  • Franco Barbanera, Ivan Lanese and Ugo De'Liguoro.
    Retractable and Speculative Contracts
  • Fabio Gadducci, Hernán Melgratti and Christian Roldán.
    A denotational view of replicated data types
  • Paolo Baldan, Alessandro Beggiato and Alberto Lluch Lafuente.
    Many-to-Many Information Flow Policies
  • Antonio Brogi, Andrea Canciani and Jacopo Soldani.
    Modelling the dynamic reconfiguration of application topologies, faults included
  • Simon Bliudze, Alena Simalatsar and Alina Zolotukhina.
    Constraint-Flow Nets: A Model for Building Constraints from Resource Dependencies
  • Francisco Durán and Gwen Salaün.
    Verifying Timed BPMN Processes using Maude
  • Giovanni Bernardi and Adrian Francalanza.
    Full-abstraction for Must Testing Preorders (Extended Abstract)
  • Maurice H. Ter Beek, Josep Carmona, Rolf Hennicker and Jetty Kleijn.
    Communication Requirements for Team Automata
  • Maxime Louvel, François Pacull, Eric Rutten and Adja Ndeye Sylla.
    Development tools for rule-based coordination programming

The final proceedings of COORDINATION'17 are available online for a limited time from

DAIS 2017

  • Fabrizio Montesi and Dan S. Thrane.
    Packaging Microservices
  • Stefan Contiu, Laurent Réveillère and Emmanuel Leblond.
    Benchmarking Cryptographic Schemes for Securing Public Cloud Storages
  • Roberta Barbi, Vitaly Buravlev, Claudio Antares Mezzina and Valerio Schiavoni.
    Block placement strategies for fault-resilient distributed tuple spaces: an experimental study
  • Francisco Maia, João Paulo, Fábio Coelho, Francisco Neves, José Pereira and Rui Oliveira.
    DDFLASKS: deduplicated very large scale data store
  • Fábio Coelho, Miguel Matos, José Pereira and Rui Oliveira.
    Similarity Aware Shuffling for the Distributed Execution of SQL Window Functions
  • Stefan Brenner, Tobias Hundt, Giovanni Mazzeo and Ruediger Kapitza.
    Secure Cloud Micro Services using Intel SGX
  • Robert Riemann and Stephane Grumbach.
    Distributed Random Process for a large-scale Peer-to-Peer Lottery
  • Tim Jungnickel and Ronny Bräunlich.
    formic: Building Collaborative Applications with Operational Transformation
  • Nils Kopal, Matthäus Wander, Christopher Konze and Henner Heck.
    Adaptive Cheat Detection in Decentralized Volunteer Computing with Untrusted Nodes
  • Damiano Di Francesco Maesa, Paolo Mori and Laura Ricci.
    Blockchain Based Access Control
  • Nikos Zacheilas and Vana Kalogeraki.
    DIsCO: DynamIc Data Compression in Distributed Stream Processing Systems
  • Bouget Simon, Bromberg Yerom David, Francois Taiani and Anthony Ventresque.
    Scalable Anti-KNN: Decentralized Computation of k-Furthest-Neighbor Graphs with HyFN
  • Alexander Jahl, Harun Baraki, Tam Huu Tran, Ramaprasad Kuppili and Kurt Geihs.
    Lifting Low-Level Workflow Changes through User-Defined Graph-Rule-Based Patterns
  • Resmi Ariyattu and Francois Taiani.
    Filament: a cohort construction service for decentralized collaborative editing platforms
  • Sînica Alboaie and Doina Cosovan.
    Private Data System enabling Self-Sovereign Storage managed by Executable Choregraphies

The final proceedings of DAIS'17 are available online for a limited time from

FORTE 2017

  • Manuel Adameit, Kirstin Peters and Uwe Nestmann
    Session Types for Link Failures
  • Ètienne Andrè and Shang-Wei Lin
    Learning-based compositional parameter synthesis for event-recording automata
  • Alasdair Armstrong and Brijesh Dongol
    Modularising opacity verification for Hybrid Transactional Memory
  • Alasdair Armstrong, Brijesh Dongol and Simon Doherty
    Proving Opacity via Linearizability: A Sound and Complete Method
  • Keyvan Azadbakht, Nikolaos Bezirgiannis and Frank de Boer
    On Futures for Streaming Data in ABS (Short Paper)
  • Mauricio Cano, Jaime Arias and Jorge A. Pérez
    Session-based Concurrency, Reactively
  • Lúıs Cruz-Filipe and Fabrizio Montesi
    Procedural Choreographic Programming
  • John Derrick and Graeme Smith
    An observational approach to defining linearizability on weak memory models
  • J Paul Gibson, Souad Kherroubi and Dominique Méry
    Applying a Dependency Mechanism in the formal development of Voting Protocol Models Using Event-B
  • Ruggero Lanotte, Massimo Merro and Simone Tini
    Weak simulation quasimetric in a gossip scenario
  • Annabelle McIver, Carroll Morgan, Tahiry Rabehaja and Nicolàs E. Bordenabe
    Reasoning about distributed secrets
  • Fabrizio Montesi
    Classical Higher-Order Processes (Short Paper)
  • Joachim Parrow, Tjark Weber, Johannes Borgström and Lars-Henrik Eriksson
    Weak Nominal Modal Logic
  • Viorel Preoteasa, Iulia Dragomir and Stavros Tripakis
    Type Inference of Simulink Hierarchical Block Diagrams in Isabelle
  • Stefan Vijzelaar and Wan Fokkink
    Creating Bu ̈chi Automata for Multi-Valued Model Checking
  • Marcel von Maltitz, Cornelius Diekmann and Georg Carle
    Privacy Assessment using Static Taint Analysis (Tool Paper)
  • Mathias Weber, Annette Bieniusa and Arnd Poetzsch-Heffter
    EPTL - A Temporal Logic for Weakly Consistent Systems (Short Paper)

The final proceedings of FORTE'17 are available online for a limited time from