Programmers have come to embrace dynamically-typed languages for prototyping and
delivering large and complex systems. When it comes to maintaining and evolving these …

In this functional pearl, we examine the use of definitional interpreters as a basis for abstract
interpretation of higher-order programming languages. As it turns out, definitional …

Building effective symbolic execution engines poses challenges in multiple dimensions: an
engine must correctly model the program semantics, provide flexibility in symbolic execution …

We present in a tutorial way some ideas developed in the context of the Ciao Prolog system
that we believe could be useful for the future evolution of Prolog. We concentrate primarily …

In this paper, we study the problem of generating inputs to a higher-order program causing it
to error. We first approach the problem in the setting of PCF, a typed, core functional …

Software contracts allow programmers to state rich program properties using the full
expressive power of an object language. However, since they are enforced at runtime …

We introduce SCIO*, a formally secure compilation framework for statically verified programs
performing input-output (IO). The source language is an F* subset in which a verified …

We present a new technique for automatically detecting logical errors in functional
programming assignments. Compared to syntax or type errors, detecting logical errors …

A sound gradual type system ensures that untyped components of a program can never
break the guarantees of statically typed components. This assurance relies on runtime …

Separation logic [Reynolds 2002] supports the modular static verification of heap-
manipulating programs. The↦→ operator asserts both ownership of a heap location and its …