Lionel Rieg

According to our database1, Lionel Rieg authored at least 20 papers between 2008 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Computer Aided Formal Design of Swarm Robotics Algorithms.
CoRR, 2021

2020
Virtual timeline: a formal abstraction for verifying preemptive schedulers with temporal isolation.
Proc. ACM Program. Lang., 2020

2019
Synchronous Gathering without Multiplicity Detection: a Certified Algorithm.
Theory Comput. Syst., 2019

Towards Coq-verified Esterel Semantics and Compiling.
CoRR, 2019

Dependent Pearl: Normalization by realizability.
CoRR, 2019

Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots.
Proceedings of the Networked Systems - 7th International Conference, 2019

Integrating Formal Schedulability Analysis into a Verified OS Kernel.
Proceedings of the Computer Aided Verification - 31st International Conference, 2019

2018
Brief Announcement Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

A Foundational Framework for Certified Impossibility Results with Mobile Robots on Graphs.
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017
A formally verified compiler for Lustre.
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.
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.
CoRR, 2016

Certified Universal Gathering in \mathbb R ^2 for Oblivious Mobile Robots.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Brief Announcement: Certified Universal Gathering in R<sup>2</sup> for Oblivious Mobile Robots.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2015
Impossibility of gathering, a certification.
Inf. Process. Lett., 2015

A Certified Universal Gathering Algorithm for Oblivious Mobile Robots.
CoRR, 2015

2014
On Forcing and Classical Realizability. (Forcing et réalisabilité classique).
PhD thesis, 2014

2013
Extracting Herbrand trees from Coq
CoRR, 2013

Extracting Herbrand trees in classical realizability using forcing.
Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2008
Good Friends are Hard to Find!
Proceedings of the 15th International Symposium on Temporal Representation and Reasoning, 2008


  Loading...