The majority of work carried out in the formal methods community throughout the last three
decades has (for good reasons) been devoted to special languages designed to make it …

ACL2 is a reimplemented extended version of RS Boyer and JS Moore's (1979; 1988)
Nqthm and M. Kaufmann's (1988) Pc-Nqthm, intended for large scale verification projects …

Communication protocols pose interesting and difficult challenges for verification
technologies. The state spaces of interesting protocols are either infinite or too large for finite …

For twenty years the Nuprl (“new pearl”) system has been used to develop software systems
and formal theories of computational mathematics. It has also been used to explore and …

We describe a computer-aided verification system which combines deductive with
algorithmic (model-checking) verification methods. The system, called tlv (for temporal …

This paper refines and extends an earlier one by the first author [1]. It considers the problem
of reasoning about the reliability of fault-tolerant systems with two “channels”(ie …

We present a method for efficiently providing algebraic correctness proofs for
communication systems. It is described in the setting of μCRL [JF Groote, A. Ponse, The …

We present several approaches to verifying a class of circuits with the Coq proof-assistant,
using the example of a left-to-right comparator. The large capacity of expression of the …

We study formal proofs conceived to be checked automatically. These proofs are rarely
used. We think that it is partly due to the fact that it is very difficult for a human to understand …

PVS (Prototype Verification System) is a comprehensive framework for writing formal logical
specifications and constructing proofs. An interactive proof checker is a key component of …