We discuss the formalization, in the Matita Theorem Prover, of basic results on multi-tapes
Turing machines, up to the existence of a (certified) Universal Machine, and propose it as a …

Enumerations represented as bijections between the natural numbers and elements of
some given type have recently garnered interest in property-based testing because of their …

We show how to reason, in the proof assistant Coq, about realistic programming languages
using a combination of separation logic and heterogeneous multimodal logic. A …

We propose a benchmark to compare theorem-proving systems on their ability to express
proofs of compiler correctness. In contrast to the first POPLmark, we emphasize the …

We present MutantChick, a mutation analysis tool for Coq to be used in combination with
QuickChick to evaluate the fault detection capability of propertybased testing in a proof …

This tutorial is designed for those familiar with the call-by-value λ-calculus (and evaluation
contexts), but not Redex. The tutorial works though a model of the λ-calculus extended with …

Formal models are important tools in the programming language research community.
However, such models are full of intricacies and, due to that, they are subject to subtle …

This work proposes a Prolog-dialect for the found and prioritised problems on expressibility
and automation. Given some given C-like program, if dynamic memory is allocated, altered …