19th International Conference on
Relational and Algebraic Methods in Computer Science

RAMICS 2021 will take place at CIRM close to Marseille from 2 to 5 November 2021.

Since 1994, the RAMiCS conference series has been the main venue for research on relation algebras, Kleene algebras and similar algebraic formalisms, and their applications as conceptual and methodological tools in computer science and beyond.

Theoretical aspects include semigroups, residuated lattices, semirings, Kleene algebras, relation algebras, quantales and other algebras; their connections with program logics and other logics; their use in the theories of automata, concurrency, formal languages, games, networks and programming languages; the development of algebraic, algorithmic, category-theoretic, coalgebraic and proof-theoretic methods for these theories; their formalisation with theorem provers.

Applications include tools and techniques for program correctness, specification and verification; quantitative and qualitative models and semantics of computing systems and processes; algorithm design, automated reasoning, network protocol analysis, social choice, optimisation and control.

Invited Speakers

Accepted papers

List of accepted papers.


Please register using the CIRM's pre-registration page.


RAMICS 2021 will take place at CIRM, the Centre International de Rencontres Mathématiques, at Luminy campus close to Marseille and on the border of the Calanques National Park. There will be no inscriptions fees to the conference, you will only need to care of lodging and catering expenses at CIRM. A limited number of grants, covering both lodging and catering, are being sponsored by CIRM and the Archimède Institute.

Access to virtual room

Will be available from the CIRM web page of this conference.


The RAMiCS-19 proceedings are available at the Springer website.


All times in CET; click on time to convert to other time zones. Speakers are underlined, click on titles to see abstracts. The program is also available as a pdf file.
Monday November 1, 2021
Tuesday November 2, 2021
9:00 Session 1. Chair Roland Glück
9:00 Christophe Lucas and Matteo Mio Free Modal Riesz Spaces are Archimedean: a Syntactic Proof Slides
9:30 Wesley Fussner and William Zuluaga Botero Some modal and temporal translations of generalized basic logic Slides
10:00 Willem Conradie, Valentin Goranko and Peter Jipsen Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm PEARL Slides
10:30Coffee break
11:00 Session 2. Chair Sam van Gool
11:00 Frank Valencia, Sergio Ramírez, Santiago Quintero and Carlos Pinzón Computing Aggregated Knowledge as the Greatest Lower Bound of Knowledge Slides
11:30 Cameron Calk, Uli Fahrenberg, Christian Johansen, Georg Struth and Krzysztof Ziemiański lr-Multisemigroups, Modal Quantales and the Origin of Locality Slides
12:00 Jérémie Marquès Polyadic spaces and profinite monoids Slides
14:00 Session 3. Chair Silvio Ghilardi
14:00 Dmitriy Zhuk Quantified Constraint Satisfaction Problem: towards the classification of complexity (invited talk) Slides
15:00 Natanael Alpay, Peter Jipsen and Melissa Sugimoto Unary-determined distributive l-magmas and bunched implication algebras Slides
15:30Coffee break
16:00 Session 4. Chair Uli Fahrenberg
16:00 Wolfgang Poiger Many-valued modal logic over a semi-primal algebra (short talk) Slides
16:20 Stefano Aguzzoli and Matteo Bianchi Amalgamation property for varieties of BL-algebras generated by one chain with finitely many components Slides
16:50 Claudia Muresan Subreducts and Subvarieties of PBZ*–lattices (short talk) Slides
17:10 Khyodeno Mozhui and K. V. Krishna On the Representation Number of Bipartite Graphs (short talk) Slides
Wednesday November 3, 2021
9:00 Session 5. Chair Peter Jipsen
9:00 Callum Bannister, Peter Höfner and Georg Struth Effect Algebras, Girard Quantales and Complementation in Separation Logic Slides
9:30 Luigi Santocanale Skew metrics valued in Sugihara semigroups Slides
10:00 George Metcalfe, Sam van Gool, Adrien Guatto and Simon Santschi Time Warps, from Algebra to Algorithms Slides
10:30Coffee break
11:00 Session 6. Chair Stepan Kuznetsov
11:00 Roland Glück Isolated Sublattices and their Application to Counting Closure Operators Slides
11:30 Chad Nester A Variety Theorem for Relational Universal Algebra Slides
12:00 Cameron Calk, Philippe Malbos and Eric Goubault Abstract Strategies and Coherence Slides
13:30Business meeting
14:30 Session 7. Chair Georg Struth
14:30 Marcelo Frias Relational Tight Field Bounds for Distributed Analysis of Programs (invited talk) Slides
15:30Coffee break
16:00 Session 8. Chair Rudolf Berghammer
16:00 Michael Winter Change of Base using Arrow Categories Slides
16:30 George Addison, Sajal Saha, and Michael Winter L-fuzzy Concept Analysis using Arrow Categories (short talk) Slides
16:50 Alexandre Fernandez, Luidnel Maignan and Antoine Spicher Accretive Computation of Global Transformations Slides
17:20 Ralph Sarkis Quotienting a Monad via Projective Algebras (short talk) On board!
17:40 Cédric de Lacroix Generalizing Girard quantale in a symmetric closed monoidal category (short talk) Slides
Thursday November 4, 2021
9:00 Session 9. Chair Barbara König
9:00 Bernhard Möller, Peter O'Hearn and Tony Hoare On Algebra of Program Correctness and Incorrectness Slides
9:30 Walter Guttmann Second-Order Properties of Undirected Graphs Slides
10:00 Walter Guttmann and Nicolas Robinson-O'Brien Relation-algebraic Verification of Borůvka's Minimum Spanning Tree Algorithm Slides
10:30Coffee break
11:00 Session 10. Chair Bernhard Möller
11:00 Rudolf Berghammer and Mitja Kulczynski Experimental Investigation of Sufficient Criteria for Relations to Have Kernels Slides
11:30 Rudolf Berghammer Relational Computation of Sets of Relations Slides
12:00 Kangfeng Ye, Simon Foster and Jim Woodcock Automated Reasoning for Probabilistic Sequential Programs with Theorem Proving Slides
14:00Free afternoon
Friday November 5, 2021
9:00 Session 11. Chair Wesley Fussner
9:00 Agi Kurucz, Vladislav Ryzhikov, Yury Savateev and Michael Zakharyaschev Deciding FO-definability of Regular Languages Slides
9:30 Damien Pous, Jurriaan Rot and Jana Wagemaker On Tools for Completeness of Kleene Algebra with Hypotheses Slides
10:00 Jas Šemrl Domain Range Semigroups and Finite Representations Slides
10:30Coffee break
11:00 Session 12. Chair Jurriaan Rot
11:00 Amina Doumane The class of representable semilattice-ordered monoids is not a variety
11:30 Stepan Kuznetsov Relational Models for the Lambek calculus with Intersection and Unit Slides
12:00 Matthias Naaf Computing Least and Greatest Fixed Points in Absorptive Semirings Slides
14:00 Session 13. Chair Dale Miller
14:00 Barbara König Fixpoint Games (invited talk) Slides
15:00 Michael Winter Relational Sums and Splittings in Categories of L-fuzzy Relations Slides
15:30Coffee break
16:00 Session 14. Chair Luidnel Maignan
16:00 Michael Winter FuReM - A System for Visualization and Manipulation of L-Fuzzy Relations (short talk) Slides
16:20 Jas Šemrl Finite Representation Property for Relation Algebra Reducts (short talk) Slides
16:40 Roland Glück On the Computation of Isolated Sublattices (short talk) Slides
17:00 Manfred Droste, Sven Dziadek, and Werner Kuich Greibach Normal Form and Simple Automata for Weighted ω-Context-Free Languages (short talk) Slides
17:20 Uli Fahrenberg, Christian Johansen, Georg Struth and Krzysztof Ziemiański Languages of Higher-Dimensional Automata (short talk) Slides
Saturday November 6, 2021

Call for papers

Submission is via EasyChair at https://www.easychair.org/conferences/?conf=ramics2021.

Springer LNCS logo

All papers will be peer-reviewed by at least three referees. The proceedings will be published in an LNCS volume by Springer, ready at the conference. Submissions must not be published or under review for publication elsewhere. Submissions must be in English using a PDF not exceeding 16 pages in LNCS style.

Submissions must provide sufficient information to judge their merits. Additional material may be provided in a clearly marked appendix or by a reference to a manuscript on a web site. Experimental data, software or mathematical components for theorem provers must be available in sufficient detail for referees. Deviation from these requirements may lead to rejection.

One author of each accepted paper is expected to present the paper at the conference. Accepted papers must be produced with LaTeX. Formatting instructions and LNCS style files are available at http://www.springer.de/comp/lncs/authors.html.

As for earlier RAMiCS conferences, we intend to publish a journal special issue with revised and extended versions of a selection of the best papers.

Call for short contributions/posters

Additionally to the standard CfP, RAMiCS is also calling for short contributions and posters. We are hence calling for presentations of original, unfinished, already published, or otherwise interesting work within the topics of the RAMiCS conferences. The submission can be in the form of a poster, an abstract, a paper submitted to or published at another conference, etc. Short contributions will not be published in the conference proceedings.

Please send your short submission to ramics2021@easychair.org by 29 August 2021.

Important dates

All dates are AoE (anywhere on Earth):

Application for grants, covering lodging and catering:


See you in Moscow (most probably).

RAMICS 2021 Sponsors

LIS logo CIRM logo

Archimède logo AMU logo