Fault-tolerant distributed systems often contain complex error handling code. Such code is
hard to test or model-check because there are often too many possible failure scenarios to …

Distributed programs are known to be extremely difficult to implement, test, verify, and
maintain. This is due in part to the large number of possible unforeseen interactions among …

Since security protocols form the cornerstones of modern secure networked systems, it is
important to develop informative, accurate, and deployable approach for finding errors and …

With the exception of some well-funded industries, legal documents remain difficult and
expensive to use, and prone to ambiguities. Emerging blockchain technologies hold the …

This paper extends the proof methods used by the Nuprl proof assistant to reason about the
computational behavior of its untyped programs. We have implemented new methods to …

This paper presents a paradigm for using proof assistants in the programming process. We
demonstrate how the programming language EventML provides a useful interface to proof …

Formal methods are vital for ensuring the security and reliability of the network systems. We
propose a promising method to check security properties of cryptographic protocols using …

This paper describes ShadowDB, a replicated version of the BerkeleyDB database.
ShadowDB is a primary-backup based replication protocol where failure handling, the …

We present a fault-tolerant ordered broadcast service that is correct-by-construction. Our
broadcast service allows for diversity in space, whereby the participants in the broadcast …

In this article I will examine a few key concepts and design decisions that account for the
high value of implemented constructive type theories in computer science. I'll stress the …