Inductive data types are a valuable modeling tool for software verification. In the past,
decision procedures have been proposed for various theories of inductive data types, some …

Contract languages such as JML and Spec# specify invariants and pre-and postconditions
using side-effect free expressions of the programming language, in particular, pure methods …

Composition-nominative logics are algebra-based logics of partial predicates constructed in
a semantic-syntactic style on the methodological basis, which is common with programming …

Well-Definedness is important for many formal methods. In B and Event-B it ensures that
certain kinds of errors (eg, division by 0) cannot appear and that proof rules based on two …

The theory of recursive data types is a valuable modeling tool for software verification. In the
past, decision procedures have been proposed for both the full theory and its universal …

Formal specifications often contain partial functions that may lead to ill-defined terms. A
common technique to eliminate ill-defined terms is to require well-definedness conditions to …

Partial functions are ubiquitous in Knowledge Representation applications, ranging from
practical, eg, business applications, to more abstract, eg, mathematical and programming …

We argue that in some KR applications, we want to quantify over sets of concepts formally
represented by symbols in the vocabulary. We show that this quantification should be …

Choices in the semantics and the signature of a theory are integral in determining how the
theory is used and how challenging it is to reason over it. Our interest in this paper lies in the …

The Verifying Compiler (VC) project is a core component of the Dependable Systems
Evolution Grand Challenge. The VC offers the promise of automatically proving that a …