News & Events

ACTS 2023 - Workshop on Automata, Concurrency, and Timed Systems

The 6th edition of the Workshop on Automata, Concurrency, and Timed Systems will take place from 30 May to 2 June 2023 at ENS Paris-Saclay.

The workshop series emerged from a long-standing Indo-French cooperation in the areas of ACTS: Automata and Logic, Concurrency Theory, and Timed Systems.

As a special event, this year's programme features a session in honour of Paul Gastin on the occasion of his retirement.

For information on the programme and registration, visit the workshop page.

Alonzo Church Award 2023 for Jacques-Henri Jourdan

Congratulations to Jacques-Henri Jourdan and his co-authors who will receive the 2023 Alonzo Church Award for their outstanding contributions to Logic and computation with the design and implementation of Iris, a higher-order concurrent separation logic framework. The Award will be presented at the 50th EATCS International Colloquium on Automata, Languages and Programming, ICALP 2023, in July.

Iris has been widely used in academia, and also in industry, e.g., by engineers at Meta to verify the core components of an interprocess communication system for a new operating system.


Invited Visit of Achim Brucker

Dr. Achim Brucker is a full Professor in Computer Science (Chair of Cybersecurity) at the University of Exeter, UK and a leading expert in secure software engineering, cyber security, and formal methods. He is the head of the Cybersecurity Group at Exeter and leads the Software Assurance & Security Research Team. From December 2015 to May 2019, he was a Senior Lecturer and Consultant at the Computer Science Department of The University of Sheffield, UK.

Achim will visit the LMF in the period from the 8th of May to the 8th of June. Besides his collaborations in the field of Ontology-based Modelling and Formal Software Engineering, three major presentations are planned:

  • a keynote seminar on Computer Security on 16 May;
  • a talk on Neural Network Verification in the GT Formal AI;
  • a workshop on theoretical and practical Computer Security to the end of his visit, addressing PhD students and postdocs.

Jean-Christophe Filliâtre and Andrei Paskevich win VerifyThis Competition

Jean-​Christophe Filliâtre and Andrei Paskevich have been awarded the prize for the Best Contributed Problem at this year's VerifyThis Competition held as a satelite event of ETAPS 2023.

VerifyThis is a series of program verification competitions, which takes place annually since 2011. The competition offers a number of challenges presented in natural language and pseudocode. Participants have to formalise the requirements, implement a solution, and formally verify the implementation for adherence to the specification.

PhD Defence: Pierre Vandenhove

Strategy Complexity of Zero-Sum Games on Graphs
by Pierre Vandenhove
Wednesday 26 April 2023 at 4pm
UMONS Salle Vésale 30, Mons and online

Pierre Vandenhove

Abstract: We study two-player zero-sum turn-based games on graphs, a framework of choice in theoretical computer science. Such games model the possibly infinite interaction between a computer system (often called reactive) and its environment. Read more...

Gilles Dowek nommé au Conseil supérieur des programmes

Gilles Dowek

Gilles Dowek vient d'être nommé au Conseil supérieur des programmes.

Lire l'article

Journée Méthodes de Test pour la Vérification et la Validation

Jeudi, 16 Mars 2023
Accueil : espace SIMONON, Salle 1E19, bâtiment Sud-Ouest ENS Paris-Saclay
Exposés : Salle 1Z28, bâtiment Nord ENS Paris-Saclay (éventuellement 1B18)
Lien visio : Zoom (Meeting ID: 994 7419 3300, Passcode: 89821603)


Larencontre annuelle du groupe de travail MTV2 Méthodes de Test pour la Vérification et la Validation sera organisée au LMF par Burkhart Wolff, Frédéric Voisin et Fatiha Zaidi le 16 mars 2023,


PhD Defence: Agustín Borgna

Towards a formal compilation stack-frame in quantum computing
by Agustín Borgna
Friday 13 January 2023 at 3pm
Loria, Nancy and online

Agustin Borgna

Abstract: The advent of quantum computers capable of solving problems that are intractable on classical computers has motivated the development of new programming languages and tools for quantum computing. However, the current state of the art in quantum programming is still in its infancy.

In this thesis, we present a series of novel approaches to different aspects of the quantum compilation process based on the ZX calculus. Read more...

PhD Defence: Glen Mével

Cosmo: a concurrent separation logic for the weak memory of Multicore OCaml
by Glen Mével
Wednesday 14 December 2022 at 2pm
Inria Paris,. 2 rue Simone Iff, Paris, Salle Lions 1, and online

Abstract: Multicore OCaml extends OCaml with support for shared-memory concurrency. It is equipped with a weak memory model, for which an operational semantics has been published. This begs the question: what reasoning rules can one rely upon while writing or verifying Multicore OCaml code?

To answer it, we instantiate Iris, a modern descendant of Concurrent Separation Logic, for Multicore OCaml. This yields a low-level program logic whose reasoning rules expose the details of the memory model. On top of it, we build a higher-level logic, Cosmo, which trades off some expressive power in return for a simple set of reasoning rules that allow accessing non-atomic locations in a data-race-free manner, exploiting the sequentially-consistent behavior of atomic locations, and exploiting the release/acquire behavior of atomic locations. Cosmo allows both low-level reasoning, where the details of the Multicore OCaml memory model are apparent, and high-level reasoning, which is independent of this memory model.


Best Process-Mining Dissertation Award for Mathilde Boltenhagen

Mathilde Boltenhagen

Mathilde Boltenhagen received the Best Process Mining PhD Dissertation Award 2022 during the Fourth International Conference on Process Mining (ICPM 2022) for her thesis entitled "Process Instance Clustering based on Conformance Checking Artefacts".


PhD Defence: Kostia Chardonnet

Towards a Curry-Howard Correspondence for Quantum Computation
by Kostia Chardonnet
Monday 9 January 2023 at 2pm
Salle des thèses, PCRI and online

Abstract: In this thesis, we are interested in the development of a Curry-Howard correspondence for quantum computing, allowing to represent quantum types and quantum control-flow. In the standard model of Quantum Computation, a classical computer is linked to a quantum coprocessor. The classical computer can then send instructions to allocate, update, or read quantum registers. The programs executed by the coprocessor are represented by a quantum circuit: a sequence of instructions that applies unitary operations to the input quantum bits. Read more...