We propose a framework to build formal developments for robot networks using the Coq
proof assistant, to state and prove formally various properties. We focus in this paper on …

Recent advances in Distributed Computing highlight models and algorithms for autonomous
swarms of mobile robots that self-organise and cooperate to solve global objectives. The …

We present the rewriting toolkit CiME3. Amongst other original features, this version enjoys
two kinds of engines: to handle and discover proofs of various properties of rewriting systems…

Nowadays, formal methods rely on tools of different kinds: proof assistants with which the
user interacts to discover a proof step by step; and fully automated tools which make use of (…

Software engineering, automated reasoning, rule-based programming or specifications
often use rewriting systems for which termination, among other properties, may have to be …

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 …

Company-Coq is a new Emacs package that extends Proof General with a contextual auto-completion
engine for Coq proofs and many additional facilities to make writing proofs easier …

We describe a package to reason efficiently about executable specifications in Coq. The
package provides a command for synthesizing a customized induction principle for a …

This paper proposes a novel application of Interactive Proof Assistants for studying the
formal properties of Narratives, building on recent work demonstrating the suitability of …

We present a new method to specify a certain class of quotient in intentional type theory,
and in the calculus of inductive constructions in particular. We define the notion of “normalized …