Published in

Elsevier, Electronic Notes in Theoretical Computer Science, (184), p. 171-187, 2007

DOI: 10.1016/j.entcs.2007.03.021

Links

Tools

Export citation

Search in Google Scholar

From Predicates to Programs: The Semantics of a Method Language

Journal article published in 2007 by David Faitelson, James Welch ORCID, Jim Davies
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Red circle
Postprint: archiving forbidden
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

This paper explains how a declarative method language, based upon the formal notations of Z and B, can be used as a basis for automatic code generation. The language is used to describe the intended effect of operations, or methods, upon the components of an object model; each method is defined by a pair of predicates: a precondition, and a post-condition. Following the automatic incorporation of model invariants, including those arising from class associations, these predicates are extended—again, automatically—to address issues of consistency, definition, and dependency, before being translated into imperative programs. The result is a formal method for transforming object models into complete, working systems.