Transactional objects combine the performance of classical concurrent with high-level programmability transactional memory. However, verifying correctness is tricky, requiring reasoning simultaneously about objects, which guarantee atomicity individual methods—the property known as linearizability—and software-transactional-memory libraries, user-defined sequences method calls—or serializabilit...

In verified generic programming, one cannot exploit the structure of concrete data types but has to rely on well chosen sets specifications or abstract (ADTs). Functors and monads are at core many applications functional programming. This raises question what useful ADTs for functors could look like. The functorial map important preserves extensional equality. For instance, if $f, g : A \righta...

We report in this paper on the formal verification of a simple compiler for the C-like programming language C0. The compiler correctness proof meets the special requirements of pervasive system verification and allows to transfer correctness properties from the C0 layer to the assembler and hardware layers. The compiler verification is split into two parts: the correctness of the compiling spec...