We propose a method for automatically finding refinement types of higher-order function
programs. Our method is an extension of the Ice framework of Garg et al. for finding …

Motivated by applications in automated verification of higher-order functional programs, we
develop a notion of constrained Horn clauses in higher-order logic and a decision problem …

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 …

Existing approaches to temporal verification of higher-order functional programs have either
sacrificed compositionality in favor of achieving automation or vice-versa. In this paper we …

We propose the integration of a random test generation system (capable of discovering
program bugs) and a refinement type system (capable of expressing and verifying program …

We present an automated approach to verifying termination of higher-order functional
programs. Our approach adopts the idea from the recent work on termination verification via …

We present ConSORT, a type system for safety verification in the presence of mutability and
aliasing. Mutability requires strong updates to model changing invariants during program …

Recent works have shown the power of linear indexed type systems for enforcing complex
program properties. These systems combine linear types with a language of type-level …

This paper considers verification of non-deterministic higher-order functional programs. Our
contribution is a novel type system in which the types are used to express and verify …

A smart contract is a program executed on a blockchain, based on which many
cryptocurrencies are implemented, and is being used for automating transactions. Due to the …