Lionel Rieg

According to our database, Lionel Rieg authored at least 22 papers between 2008 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Swarms of Mobile Robots: Towards Versatility with Safety.

Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain

Leibniz Trans. Embed. Syst., 2022

2021

Computer Aided Formal Design of Swarm Robotics Algorithms.

Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2021

A generic approach for the certified schedulability analysis of software systems.

Xiaojie Guo, Lionel Rieg, Paolo Torrini

Proceedings of the 27th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, 2021

2020

Virtual timeline: a formal abstraction for verifying preemptive schedulers with temporal isolation.

Mengqi Liu, Lionel Rieg, Zhong Shao, Ronghui Gu, David Costanzo, Jung-Eun Kim, Man-Ki Yoon

Proc. ACM Program. Lang., 2020

2019

Synchronous Gathering without Multiplicity Detection: a Certified Algorithm.

Thibaut Balabonski, Amélie Delga, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain

Theory Comput. Syst., 2019

Towards Coq-verified Esterel Semantics and Compiling.

Gérard Berry, Lionel Rieg

CoRR, 2019

Dependent Pearl: Normalization by realizability.

Pierre-Évariste Dagand, Lionel Rieg, Gabriel Scherer

CoRR, 2019

Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots.

Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain

Proceedings of the Networked Systems - 7th International Conference, 2019

Integrating Formal Schedulability Analysis into a Verified OS Kernel.

Xiaojie Guo, Maxime Lesourd, Mengqi Liu, Lionel Rieg, Zhong Shao

Proceedings of the Computer Aided Verification - 31st International Conference, 2019

2018

Brief Announcement Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots.

Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

A Foundational Framework for Certified Impossibility Results with Mobile Robots on Graphs.

Thibaut Balabonski, Robin Pelle, Lionel Rieg, Sébastien Tixeuil

Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017

A formally verified compiler for Lustre.

Timothy Bourke, Lélio Brun, Pierre-Évariste Dagand, Xavier Leroy, Marc Pouzet, Lionel Rieg

Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017

Certified Gathering of Oblivious Mobile Robots: Survey of Recent Results and Open Problems.

Thibaut Balabonski, Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain

Proceedings of the Critical Systems: Formal Methods and Automated Verification - Joint 22nd International Workshop on Formal Methods for Industrial Critical Systems - and, 2017

2016

Certified Universal Gathering in $R^2$ for Oblivious Mobile Robots.

Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain

CoRR, 2016

Certified Universal Gathering in \mathbb R ^2 for Oblivious Mobile Robots.

Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain

Proceedings of the Distributed Computing - 30th International Symposium, 2016

Brief Announcement: Certified Universal Gathering in R² for Oblivious Mobile Robots.

Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2015

Impossibility of gathering, a certification.

Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain

Inf. Process. Lett., 2015

A Certified Universal Gathering Algorithm for Oblivious Mobile Robots.

Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain

CoRR, 2015

2014

On Forcing and Classical Realizability. (Forcing et réalisabilité classique).

Lionel Rieg

PhD thesis, 2014

2013

Extracting Herbrand trees from Coq

Lionel Rieg

CoRR, 2013

Extracting Herbrand trees in classical realizability using forcing.

Lionel Rieg

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2008

Good Friends are Hard to Find!

Thomas Brihaye, Nicolas Markey, Mohamed Ghannem, Lionel Rieg

Proceedings of the 15th International Symposium on Temporal Representation and Reasoning, 2008