The International Conference on Concurrency Theory (CONCUR) brings together researchers, developers, and students in order to advance the theory of concurrency and promote its applications. CONCUR solicits high quality papers reporting research results and/or experience related to semantics, logics, verification and analysis of concurrent systems.

The 2026 edition will be co-located with QEST+FORMATS, FMICS and a number of workshops under the joint name CONFEST 2026, which will take place September 1-5, 2026 at the University of Liverpool, UK.

Important dates

- Abstracts: 20 April, 2026 (AoE)
- Submissions: 27 April, 2026 (AoE)
- Rebuttal: 1–3 June, 2026 (AoE)
- Notification: 15 June, 2026 (AoE)
- Camera Ready: 29 June, 2026 (AoE)
- Conference: 1–4 September, 2026
- Workshops: 5 September, 2026

Topics

Submissions are solicited in the theory and practice of concurrent systems.
The principal topics include (but are not limited to):

- Basic models of concurrency such as abstract machines, domain-theoretic models, categorical and coalgebraic models, game-theoretic models, parametric models, process algebras, graph transformation systems, Petri nets, hybrid systems, mobile and collaborative systems, probabilistic systems, real-time systems, quantum systems, biology-inspired systems, and synchronous systems;

- Logics for concurrency such as modal logics, program logics, probabilistic and stochastic logics, temporal logics, multi-agent logics, and resource logics;

- Verification and analysis techniques for concurrent systems such as abstract interpretation, atomicity checking, model checking, race detection, pre-order and equivalence checking, run-time verification, state-space exploration, static analysis, synthesis, testing, theorem proving, type systems, and security analysis;

- Distributed/parallel algorithms and concurrent data structures: design, analysis, complexity, correctness, fault tolerance, reliability, availability, consistency, self-organization, self-stabilization, commitment schemes, communication protocols;

- Theoretical foundations, tools, and empirical evaluations of architectures, execution environments, and software development for concurrent systems such as geo-replicated systems, distributed ledgers, communication networks, multiprocessor and multi-core architectures, quantum computing, quantum communication, shared and transactional memory, resource management and awareness, compilers and tools for concurrent programming, programming models such as component-based, object- and service-oriented.

Paper submission

- All papers must be original, unpublished, and not submitted for publication elsewhere.
- Each paper will undergo a thorough review process.
- Papers must be submitted electronically as PDF files via EasyChair (https://easychair.org/conferences?conf=concur2026).
- Proceedings will be published by LIPIcs; please use their style files (https://drops.dagstuhl.de/entities/series/LIPIcs#author) when preparing your submission.
- Submissions follow a single-blind process.
- Papers must not exceed 15 pages (excluding references and appendices, LIPIcs style)
- An appendix may provide additional material and proofs, but should not be expected to be scrutinized by the reviewers and will not be published in the proceedings.

Special Issue

A special issue dedicated to selected papers from CONCUR2026 will appear in Logical Methods in Computer Science.

Awards

There will be a CONCUR Test-of-Time award, Best Paper award, and Best Student Paper award in 2026. The winners will be announced at the conference.

Invited Speakers

- Jade Alglave, University College London / Arm, UK
- Ezio Bartocci, TU Wien, Austria
- Ichiro Hasuo, National Institute of Informatics, Japan
- Jean-Franois Raskin, Universit Libre de Bruxelles, Belgium
- Qiyi Tang, University of Liverpool, UK

Program Committee Chairs

- Ana Sokolova, University of Salzburg, Austria
- Patrick Totzke, University of Liverpool, UK

Program Committee

- Parosh Abdulla, Uppsala University, Sweden
- Giorgio Bacci, Aalborg University, Denmark
- Christel Baier, TU Dresden, Germany
- Paolo Baldan, University of Padova, Italy
- Nathalie Bertrand, INRIA Rennes, France
- Laura Bocchi, University of Kent, UK
- Filippo Bonchi, University of Pisa, Italy
- Valentina Castiglioni, Eindhoven University of Technology, the Netherlands
- Dmitry Chistikov, University of Warwick, UK
- Corina Cirstea, University of Southampton, UK
- Wojciech Czerwiski, University of Warsaw, Poland
- Javier Esparza, TU Munich, Germany
- Benjamin Kaminski, Saarland University and UCL, Germany/UK
- Tobias Kapp, Leiden University, the Netherlands
- Stefan Kiefer, University of Oxford, UK
- Barbara Knig, University of Duisburg-Essen, Germany
- Antonn Kucera, Masaryk University, Czech Republic
- Yong Li, SKLCS Beijing, China
- Nicolas Mazzocchi, STU Bratislava, Slovakia
- Roland Meyer, TU Braunschweig, Germany
- Pierre Ohlmann, CNRS, LIS Marseille, France
- Prakash Panangaden, McGill and University of Edinburgh, Canada/UK
- Kirstin Peters, University of Augsburg, Germany
- Guillermo A. Prez, University of Antwerp, Belgium
- Damien Pous, CNRS, ENS Lyon, France
- Karin Quaas, University of Leipzig, Germany
- Ege Sara, CISPA, Germany
- Sylvain Schmitz, Universit Paris Cit, France
- Henning Urbat, FAU Erlangen-Nrnberg, Germany
- Viktor Vafeiadis, MPI-SWS, Germany
- Franck van Breugel, York University, Canada
- Rob van Glabbeek, University of Edinburgh, UK
- Pierre Vandenhove, Universit de Mons, Belgium
- Kazuki Watanabe, NII, Tokyo, Japan
- Sarah Winter, Universit Paris Cit, France
- Nisansala Yatapanage, Australian National University, Australia
- Florian Zuleger, TU Wien, Austria

Steering Committee

- Luca Aceto, Reykjavik University, Iceland
- Christel Baier, TU Dresden, Germany
- Pedro R. DArgenio, National University of Crdoba, Argentina
- Wan Fokkink, VU Amsterdam, the Netherlands
- Catuscia Palamidessi, INRIA Saclay and LIX, France
- Jiri Srba, Aalborg University, Denmark

Questions regarding submissions should be directed to the PC chairs (concur2026@easychair.org(mailto:concur2026@easychair.org)).