We present a new approach for specifying and verifying resource utilization of higher-order
functional programs that use lazy evaluation and memoization. In our approach, users can …

Current static verification techniques do not provide good support for incrementality, making
it difficult for developers to focus on specifying and verifying the properties and components …

Program properties that are automatically inferred by static analysis tools are generally not
considered to be completely trustworthy, unless the tool implementation or the results are …

We propose a novel type-based model checking algorithm for higher-order recursion
schemes. As shown by Kobayashi, verification problems of higher-order functional programs …

Automatically verifying heap-manipulating programs is a challenging task, especially when
dealing with complex data structures with strong invariants, such as sorted lists and AVL/red …

Automatically verifying heap-manipulating programs is a challenging task, especially when
dealing with complex data structures with strong invariants, such as sorted lists and AVL/red …

Relational properties describe multiple runs of one or more programs. They characterize
many useful notions of security, program refinement, and equivalence for programs with …

In this thesis, we explore techniques for the development and verification of programs in a
high-level, expressive, and safe programming language. Our programs can express …

We present a new approach for constructing and verifying higher-order, imperative
programs using the Coq proof assistant. We build on the past work on the Ynot system …

Type-based amortised resource analysis following Hofmann and Jost---where resources are
associated with individual elements of data structures and doled out to the programmer …