This paper reports on a six-year collaborative effort that culminated in a complete
formalization of a proof of the Feit-Thompson Odd Order Theorem in the Coq proof assistant …

The Tale of a Brainteaser Francis Guthrie certainly did it, when he coined his innocent little
coloring puzzle in 1852. He managed to embarrass successively his mathematician brother …

We present the first formal verification of state machine safety for the Raft consensus
protocol, a critical component of many distributed systems. We connected our proof to …

Distributed applications are difficult to program reliably and securely. Dependently typed
functional languages promise to prevent broad classes of errors and vulnerabilities, and to …

Efficient concurrent programs and data structures rarely employ coarse-grained
synchronization mechanisms (ie, locks); instead, they implement custom synchronization …

Distributed systems play a crucial role in modern infrastructure, but are notoriously difficult to
implement correctly. This difficulty arises from two main challenges:(a) correctly …

In this article, we consider the semantic design and verified compilation of a C-like
programming language for concurrent shared-memory computation on x86 multiprocessors …

This paper proposes generic design patterns to define and combine algebraic structures,
using dependent records, coercions and type inference, inside the Coq system. This …

This tutorial presents the Ssreflect extension to the Coq system. This extension consists of
an extension to the Coq language of script, and of a set of libraries, originating from the …

Symbolic and logic computation systems ranging from computer algebra systems to theorem
provers are finding their way into science, technology, mathematics and engineering. But …