When a computational task tolerates a relaxation of its specification or when an algorithm
tolerates the effects of noise in its execution, hardware, system software, and programming …

We propose the first framework for defining relational program logics for arbitrary monadic
effects. The framework is embedded within a relational dependent type theory and is highly …

We present Parallely, a programming language and a system for verification of
approximations in parallel message-passing programs. Parallely's language can express …

As one of the most promising energy-efficient emerging paradigms for designing digital
systems, approximate computing has attracted a significant attention in recent years …

Modern hardware is becoming increasingly susceptible to silent data corruptions. As
general methods for detection and recovery from errors are time and energy consuming …

Researchers have recently designed a number of application-specific fault tolerance
mechanisms that enable applications to either be naturally resilient to errors or include …

Verification of software and processor hardware usually proceeds separately, software
analysis relying on the correctness of processors executing machine instructions. This …

As one of the most promising energy-efficient emerging paradigms for designing digital
systems, approximate computing has attracted a significant attention in recent years …

Many emerging distributed applications operate on inherently noisy data or produce
approximate results. Emerging application domains, including IoT, self-driving cars, and …

Computational monads are a convenient algebraic gadget to uniformly represent sidee ects
in programming languages, such as mutable state, divergence, exceptions, or …