From Predicates to Programs: The Semantics of a Method Language | Zendy

David Faitelson | Zendy; James Welch | Zendy; Jim Davies | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

From Predicates to Programs: The Semantics of a Method Language

Author(s) -

David Faitelson,

James Welch,

Jim Davies

Publication year - 2007

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2007.03.021

Subject(s) - programming language , computer science , precondition , consistency (knowledge bases) , dependency (uml) , semantics (computer science) , notation , object language , formal semantics (linguistics) , object (grammar) , class (philosophy) , operational semantics , theoretical computer science , natural language processing , artificial intelligence , mathematics , natural language , arithmetic

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research