Interaction trees (ITrees) are a general-purpose data structure for representing the behaviors
of recursive programs that interact with their environments. A coinductive variant of “free …

The rise of programmable open distributed consensus platforms based on the blockchain
technology has aroused a lot of interest in replicated stateful computations, aka smart …

JavaScript is the most widely used web language for client-side applications. Whilst the
development of JavaScript was initially just led by implementation, there is now increasing …

When doing an interactive proof about a piece of software, it is important that the underlying
programming language's semantics does not make the proof unnecessarily difficult or …

This paper presents a novel formal semantics, mechanized in Coq, for a large, sequential
subset of the LLVM IR. In contrast to previous approaches, which use relationally-specified …

This paper provides a novel approach to reconciling complex low-level memory model
features, such as pointer--integer casts, with desired refinements that are needed to justify …

We present an executable, proven-safe, faithful, and future-proof Coq mechanization of
JavaScript regular expression (regex) matching, as specified by the latest published edition …

Static analysis of the evaluation cost of programs is an extensively studied problem that has
many important applications. However, most automatic methods for static cost analysis are …

The development of mechanised language specification based on structured operational
semantics, with applications to verified compilers and sound program analysis, requires …

The realization of a language design requires multiple artifacts that redundantly encode the
same information. This entails significant effort for language implementors, and often results …