Lionel Rieg
- VERIMAG (VERIMAG - IMAG)
Publications
Publications
|
|
Collaborative Action on Timing InterferenCes: Summary and Perspectives at Mid-termEmbedded Real-Time Systems (ERTS) 2026, Feb 2026, Toulouse, France. ⟨10.82331/ERTS.2026.27⟩ |
|
|
Comment se rassembler (avec certitude) quand on est confus et désorientéALGOTEL 2025 – 27èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2025, Saint Valery-sur-Somme, France |
|
|
Rendez-vous au Point-Dont-On-Ne-Doit-Pas-Calculer-Les-CoordonnéesALGOTEL 2025 – 27èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2025, Saint Valery-sur-Somme, France |
|
|
Deterministic Color-optimal Self-stabilizing Semi-synchronous Gathering: a Certified AlgorithmSIROCCO 2025, Jun 2025, Delphi, Greece. pp.127-143, ⟨10.1007/978-3-031-91736-3_8⟩ |
|
|
Computer Aided Formal Design of Swarm Robotics AlgorithmsStabilization, Safety, and Security of Distributed Systems. SSS 2021, Nov 2021, Online, Sweden. pp.469-473, ⟨10.1007/978-3-030-91081-5_31⟩ |
|
|
Comment s'assurer de garder le contact (et nos distances)ALGOTEL 2021 - 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, 2021, La Rochelle, France |
|
|
A generic approach for the certified schedulability analysis of software systemsRTCSA 2021 - 27th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, Aug 2021, Houston (online), United States. pp.1-10, ⟨10.1109/RTCSA52859.2021.00018⟩ |
|
|
A Decision Procedure for Equivalence RelationsCoq Workshop 2020, Jul 2020, Aubervilliers, France |
|
|
Du discrètement continu au continûment discretALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2020, Lyon, France |
|
|
Integrating Formal Schedulability Analysis into a Verified OS KernelComputer Aided Verification, Jul 2019, New York, United States. pp.496-514, ⟨10.1007/978-3-030-25543-5_28⟩ |
|
|
Manuel de savoir-prouver à l’usage des roboteux et des distributeuxALGOTEL 2019 - 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2019, Saint Laurent de la Cabrerisse, France. pp.1-4 |
|
|
Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots7th International Conference on NETworked sYStems (NETYS 2019), Jun 2019, Marrakech, Morocco. pp.93-09, ⟨10.1007/978-3-030-31277-0_7⟩ |
A Foundational Framework for Certified Impossibility Results with Mobile Robots on GraphsICDCN 2018 - 19th International Conference on Distributed Computing and Networking, Jan 2018, Varanasi, India. pp.1-10, ⟨10.1145/3154273.3154321⟩ |
|
Brief Announcement Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile RobotsStabilization, Safety, and Security of Distributed Systems. SSS 2018., Xavier Defago, Toshimitsu Masuzawa, Koichi Wada, Nov 2018, Tokyo, Japan. pp.404-408, ⟨10.1007/978-3-030-03232-6_29⟩ |
|
Certified Gathering of Oblivious Mobile Robots: survey of recent results and open problemsFormal Methods for Industrial Critical Systems and Automated Verification of Critical Systems (FMICS/AVOCS), Sep 2017, Turin, Italy. pp.165-181, ⟨10.1007/978-3-319-67113-0_11⟩ |
|
|
|
Vérification de la génération modulaire du code impératif pour LustreJFLA 2017 - Vingt-huitième Journées Francophones des Langages Applicatifs, Jan 2017, Gourette, France |
|
|
A Formally Verified Compiler for LustrePLDI 2017 - 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, Jun 2017, Barcelone, Spain |
Brief announcement: Certified Universal Gathering in R2 for Oblivious Mobile RobotsACM Conference on Principles of Distributed Computing (PODC), ACM, Jul 2016, Chicago, United States. pp.439-441, ⟨10.1145/2933057.2933070⟩ |
|
|
|
Certified Universal Gathering in $R^2$ for Oblivious Mobile RobotsDistributed Computing (DISC), Sep 2016, Paris, France. pp.187-200, ⟨10.1007/978-3-662-53426-7_14⟩ |
Synchronous Gathering Without Multiplicity Detection: A Certified AlgorithmInternational Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2016), Nov 2016, Lyon, France. pp.7-19, ⟨10.1007/978-3-319-49259-9_2⟩ |
|
|
|
Extracting Herbrand trees in classical realizability using forcingComputer Science Logic 2013, Simona Ronchi Della Rocca, Sep 2013, Turin, Italy. pp.15, ⟨10.4230/LIPIcs.CSL.2013.i⟩ |
|
|
Good friends are hard to find!Proceedings of the 15th International Symposium on Temporal Representation and Reasoning (TIME'08), 2008, Montréal, Canada. pp.32-40, ⟨10.1109/TIME.2008.10⟩ |
|
|
Deliverable D2.1: Study of Timing Anomalies Documented in the LiteratureVERIMAG UMR 5104, Université Grenoble Alpes, France. 2025, pp.1-32 |
|
|
Continuous vs. Discrete Asynchronous Moves: a Certified Approach for Mobile Robots[Research Report] Sorbonne Université, CNRS, Laboratoire d’Informatique de Paris 6, LIP6, F-75005 Paris, France. 2018, pp.1-12 |
|
|
Certified Universal Gathering in $R^2$ for Oblivious Mobile Robots[Research Report] UPMC; CNAM. 2016 |
|
|
A Certified Universal Gathering Algorithm for Oblivious Mobile Robots[Research Report] UPMC, Sorbonne Universites CNRS; CNAM, Paris; College de France; Université Paris Sud. 2015 |
|
|
Impossibility of Gathering, a Certification[Technical Report] CEDRIC-14-3016, CEDRIC laboratory, CNAM-Paris, France. 2014, pp.10 |
|
|
Extracting Herbrand trees from Coq2011 |
|
|
Computer Aided Formal Design of Swarm Robotics Algorithms2021 |
|
|
On Forcing and Classical RealizabilityOther [cs.OH]. Ecole normale supérieure de lyon - ENS LYON, 2014. English. ⟨NNT : 2014ENSL0915⟩ |