Recent Advances in Concurrency and Logic - RADICAL

A workshop co-located with QONFEST (CONCUR, QEST, FORMATS, and EPEW)

Berlin (Germany), September 4, 2017

NEW: Accepted contributed talks (see below)


RADICAL is a new workshop aligned within the intersection between concurrency and logic, broadly construed.

Admittedly broad, such an intersection has been explored from very diverse angles for many years now.
More recently, the interplay of concurrency and logic with areas/applications such as, for instance,

  • design, verification, synthesis for concurrent systems, both qualitative and quantitative;
  • strategic reasoning for distributed and multi-agent systems;
  • analysis and validation techniques for concurrent and distributed programs and systems (e.g., separation logics, advanced type systems, and runtime verification techniques);

has received much attention, as witnessed by recent CONCUR editionsThese areas/applications have become increasingly consolidated, and start to have profound impact in neighbouring communities such as

  • programming languages
  • artificial intelligence
  • computer security
  • knowledge representation

As an unfortunate side effect, however, the important unifying role that concurrency plays in all of them seems hard to find in a single scientific event. Indeed, there do not seem to exist appropriate venues in which different research communities interested in concurrency and logic can meet closely, cross-fertilize, and share their most exciting recent results.

RADICAL intends to fill a gap between CONCUR researchers that now also typically publish and interact in other different venues; it also aims at attracting researchers from neighbouring communities whose work naturally intersects with CONCUR.


RADICAL will offer an innovative format for a one-day workshop for researchers involved in all aspects of concurrency and logic including, but not limited to, the areas mentioned above.

Distinctive innovative aspects of RADICAL include:

  • Format: 
    RADICAL will feature a combination of invited and (short) contributed talks. 
    We would like to recover the informal character of scientific workshops.
  • Focus: 
    Rather than regular paper submissions, authors should submit three-page talk proposals (see below).
  • No proceedings: 
    RADICAL will be an informal venue, oriented to interaction, and so it will have no formal proceedings.
We invite submissions describing talk proposals on the intersection of logic and concurrency, as motivated above. 

A submission to RADICAL would typically fall within one of the following categories:

  • reports of an ongoing work and/or preliminary results;
  • summaries of an already published paper (or series of papers);
  • overviews of (recent) PhD theses;
  • descriptions of research projects and consortia;
  • manifestos, calls to action, personal views on current and future challenges;
  • overviews of interesting yet underrepresented problems.

This list is by no means exhaustive but merely indicative. 

For instance, since RADICAL will precede CONCUR (and the other main conferences co-located with QONFEST), authors of papers accepted at a main conference may consider proposing a talk in RADICAL that promotes (or gives context to) a technical talk to be delivered at the conference(s) later on the week.

Prospective authors are encouraged to contact the organizers in case of questions (

Submissions based on already published works should include explicit references/links as appropriate. Reviewers may read such prior published works, but are not obliged to so do. 

Submissions will be judged by the program committee on the basis of significance, relevance, and potential of an engaging, compelling talk at the workshop.

Submissions should be in PDF, up to three pages (not including references), produced using the EasyChair formatPlease submit your talk proposal via EasyChair:

It is understood that for each accepted submission one of the co-authors will attend the workshop and give the talk. 


  • Submission deadline: Friday, 7 July 2017 (Extended!)
  • Notification to authors: Friday, 28 July 2017.
  • CONCUR Early Registration deadline: Monday, July 31, 2017.
  • Workshop: Monday, 4 September 2017 in Berlin.

  • Emmanuel Beffara (I2M, Université d'Aix-Marseille & CNRS, FR)
  • James Brotherston (University College London, UK)
  • Marco Carbone (IT University of Copenhagen, DK)
  • Silvia Crafa (Università di Padova, IT)
  • Ugo Dal Lago (Università di Bologna, IT)
  • Rocco De Nicola (IMT Lucca, IT)
  • Constantin Enea (IRIF, University Paris Diderot, FR)
  • Wan Fokkink (Vrije Universiteit Amsterdam, NL)
  • Sibylle Fröschle (University of Oldenburg, DE)
  • Simon Gay (University of Glasgow, UK)
  • Julian Gutierrez (University of Oxford, UK - co-chair)
  • Willem Heijltjes (University of Bath, UK)
  • Marieke Huisman (University of Twente, NL)
  • Martin Leucker (University of Lübeck, DE)
  • Radu Mardare (Aalborg University, DK)
  • Carlos Olarte (Universidade Federal do Rio Grande do Norte, BR)
  • Jorge A. Pérez (University of Groningen, NL - co-chair)
  • Matteo Sammartino (University College London, UK)
  • Carsten Schürmann (IT University of Copenhagen, DK)
  • Alexandra Silva (University College London, UK)
  • Pawel Sobocinski (University of Southampton, UK)
  • Alwen Tiu (Nanyang Technological University, SG)
  • Nikos Tzevelekos (Queen Mary University of London, UK)
  • Irek Ulidowski (University of Leicester, UK)
  • Frank Valencia (CNRS & LIX, École Polytechnique, FR)
  • Hans van Ditmarsch (LORIA - CNRS / University of Lorraine, FR)
  • Rineke Verbrugge (University of Groningen, NL)
  • Philip Wadler (University of Edinburgh, UK)

  • Ross Horne and Alwen Tiu. Predicates as Processes: Linear Implication is a Branching-time Causality-preserving Precongruence
  • Patrick Totzke. Linear Combinations of Unordered Data Vectors and an Application to Coloured Petri Nets
  • Marc de Visme and Damiano Mazza. On the Concurrent Meaning of Logical Correctness
  • Luca Aceto, Antonis Achilleos, Duncan Attard, Ian Cassar, Adrian Francalanza and Anna Ingolfsdottir. Theoretical Foundations for Monitors
  • Federico Aschieri, Agata Ciabattoni and Francesco Genco. Gödel Logic: from Natural Deduction to Parallel Computation
  • Frank Valencia. Specifying, Reasoning and Programming Spatially Distributed Epistemic Systems
  • Hongwei Xi and Hanwen Wu. Multirole Logic and Multiparty Channels
  • Ian Cassar, Adrian Francalanza, Claudio Antares Mezzina and Emilio Tuosto. Reliability and fault-tolerance by choreographic design
  • Muhammad Najib. Some Approaches to Rational Verification in Multiagent Systems
  • Julian Gutierrez, Paul Harrenstein, Giuseppe Perelli and Michael Wooldridge. Expressiveness and Nash Equilibrium in Iterated Boolean Games
  • Mauricio Cano.  Declarative Approaches to Correct Communication Systems
  • Daniel Poetzl. Compositional Thread Refinement in Data-Race-Free Memory Models