6 citations · 6 across the 2 of their papers we have counts for
3 papers
cs.DC2016
Certified Universal Gathering in for Oblivious Mobile Robots
Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil +1
We present a unified formal framework for expressing mobile robots models, protocols, and proofs, and devise a protocol design/proof methodology dedicated to mobile robots that tak…
cs.DC2015★ 6 cited
A Certified Universal Gathering Algorithm for Oblivious Mobile Robots
Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil +1
We present a new algorithm for the problem of universal gathering mobile oblivious robots (that is, starting from any initial configuration that is not bivalent, using any number o…
cs.LO2013
Extracting Herbrand trees from Coq
Lionel Rieg
Software certification aims at proving the correctness of programs but in many cases, the use of external libraries allows only a conditional proof: it depends on the assumption th…