| Computer Aided Formal Design of Swarm Robotics Algorithms. | 0 | 0.34 | 2021 |
| Virtual timeline: a formal abstraction for verifying preemptive schedulers with temporal isolation | 1 | 0.36 | 2020 |
| Synchronous Gathering Without Multiplicity Detection: A Certified Algorithm. | 5 | 0.43 | 2019 |
| Continuous vs. Discrete Asynchronous Moves - A Certified Approach for Mobile Robots. | 0 | 0.34 | 2019 |
| Integrating Formal Schedulability Analysis Into A Verified Os Kernel | 1 | 0.36 | 2019 |
| A Foundational Framework for Certified Impossibility Results with Mobile Robots on Graphs. | 1 | 0.35 | 2018 |
| Brief Announcement Continuous Vs. Discrete Asynchronous Moves: A Certified Approach For Mobile Robots | 0 | 0.34 | 2018 |
| A formally verified compiler for Lustre. | 7 | 0.57 | 2017 |
| Certified Gathering of Oblivious Mobile Robots: Survey of Recent Results and Open Problems. | 0 | 0.34 | 2017 |
| Certified Universal Gathering in \mathbb R ^2 for Oblivious Mobile Robots. | 0 | 0.34 | 2016 |
| Certified Universal Gathering in $R^2$ for Oblivious Mobile Robots. | 8 | 0.50 | 2016 |
| Brief Announcement: Certified Universal Gathering in R2 for Oblivious Mobile Robots. | 1 | 0.35 | 2016 |
| A Certified Universal Gathering Algorithm for Oblivious Mobile Robots | 4 | 0.43 | 2015 |
| Impossibility of gathering, a certification. | 17 | 0.86 | 2014 |
| Extracting Herbrand trees in classical realizability using forcing. | 0 | 0.34 | 2013 |
| Extracting Herbrand trees from Coq | 0 | 0.34 | 2013 |
| Good Friends are Hard to Find! | 0 | 0.34 | 2008 |
