Functions that are guaranteed not to have side effects are common in modern procedural
languages, but not in object-oriented languages. Certain types of state changes are …

The paper presents a relatively complete proof system for proving the validity of temporal
properties of reactive programs. The presented proof system improves on previous temporal …

The UNITY substitution axiom,“if (x= y) is an invariant of a program, then x can be replaced
by y in any property of the program”, is problematic for several reasons. In this paper, dual …

This paper develops a framework for generating testing preorders that relate processes on
the basis of their timing behavior as well as their degree of relative nondeterminism. The …

This paper develops modular verification rules for Ada generics which are proven to be
sound and complete. The generic mechanism in Ada allows modules to be parameterized …

What is special about the rules of Hoare logic? This paper shows that partial correctness
logic can be viewed as a special case of the equational logic of iteration theories [6, 7, 24]. It …

This thesis provides a powerful general-purpose proof technique for the verification of
systems, whether finite or infinite. It extends the idea of finite local model-checking, which …

The analysis of partial correctness assertions given in [Béa] is specialized to matricial
iteration theories. A system of rules for partial correctness is given and a completeness …

This dissertation describes a novel method for deriving logical consequences of first-order
formulas using resolution and unskolemization. A complete unskolemization algorithm is …

We introduce and discuss a notion of strictly arithmetical completeness related to relative
completeness of Cook (1978) and arithmetical completeness of Harel (1978). We present a …