We show that manifest domains, an understanding of which are a prerequisite for software
requirements prescriptions, can be precisely described: narrated and formalised. We show …

A Foundation for Software Development Dines Bjørner Page 1 Domain Science and Engineering
A Foundation for Software Development Dines Bjørner Monographs in Theoretical Computer …

CafeOBJ is a language for writing formal specifications for a wide variety of software and
hardware systems and for verifying their properties. CafeOBJ makes it possible to verify …

CafeOBJ is a language for specifying and verifying a wide variety of software and/or
hardware systems. Traditionally, verification has been carried out via proof scores, which …

We present in this paper an interpreter implemented in Maude for non-behavioral CafeOBJ
specifications. This alternative implementation poses a number of advantages:(1) it allows …

CafeOBJ is a language for writing formal specifications of software and hardware systems. It
implements equational logic by rewriting and has been used to verify properties of systems …

Abstract Constructor-based Theorem Prover (CITP) is a tool for proving inductive properties
of software systems specified with constructor-based logics. CITP is equipped with a default …

The proof scores method is an interactive verification method in algebraic specification that
combines manual proof planning and reduction (automatic inference by rewriting). The proof …

An interactive theorem proving method for the verification of infinite state transition systems
is described. The state space of a transition system is defined as a quotient set (ie a set of …

Critical flaws continue to exist at the level of domain, requirement, and/or design
specification, and specification verification (ie, to check whether a specification has …