Results 1 
5 of
5
Toward formal development of ML programs: foundations and methodology
, 1989
"... A formal methodology is presented for the systematic evolution of modular Standard ML programs from specifications by means of verified refinement steps, in the framework of the Extended ML specification language. Program development proceeds via a sequence of design (modular decomposition), codi ..."
Abstract

Cited by 54 (23 self)
 Add to MetaCart
A formal methodology is presented for the systematic evolution of modular Standard ML programs from specifications by means of verified refinement steps, in the framework of the Extended ML specification language. Program development proceeds via a sequence of design (modular decomposition), coding and refinement steps. For each of these three kinds of steps, conditions are given which ensure the correctness of the result. These conditions seem to be as weak as possible under the constraint of being expressible as "local" interface matching requirements. Interfaces are only required to match up to behavioural equivalence, which is seen as vital to the use of data abstraction in program development. Copyright c fl 1989 by D. Sannella and A. Tarlecki. All rights reserved. An extended abstract of this paper will appear in Proc. Colloq. on Current Issues in Programming Languages, Joint Conf. on Theory and Practice of Software Development (TAPSOFT), Barcelona, Springer LNCS (1989)....
Extended ML: Past, present and future
 PROC. 7TH WORKSHOP ON SPECIFICATION OF ABSTRACT DATA TYPES, WUSTERHAUSEN. SPRINGER LNCS 534
, 1991
"... An overview of past, present and future work on the Extended ML formal program development framework is given, with emphasis on two topics of current active research: the semantics of the Extended ML specification language, and tools to support formal program development. ..."
Abstract

Cited by 23 (9 self)
 Add to MetaCart
An overview of past, present and future work on the Extended ML formal program development framework is given, with emphasis on two topics of current active research: the semantics of the Extended ML specification language, and tools to support formal program development.
Towards Trustworthy Specifications I: Consistency Checks
"... As the first of two methodological devices aimed at increasing the trust in the `correctness' of a specification, we develop a calculus for proving consistency of Casl specifications. It turns out to be possible to delegate large parts of the proof load to syntactical criteria by structuring co ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
(Show Context)
As the first of two methodological devices aimed at increasing the trust in the `correctness' of a specification, we develop a calculus for proving consistency of Casl specifications. It turns out to be possible to delegate large parts of the proof load to syntactical criteria by structuring consistency proofs along the given specification structure, so that only in rather few remaining focus points, actual theorem proving is required. The practical usability of the resulting calculus is demonstrated by extensive examples taken from the Casl library of basic data types.
A Kernel Specification Formalism with HigherOrder Parameterisation
 PROC. 7TH INTL. WORKSHOP ON SPECIFICATION OF ABSTRACT DATA TYPES, WUSTERHAUSEN. SPRINGER LNCS 534
, 1991
"... A specification formalism with parameterisation of an arbitrary order is presented. It is given a denotationalstyle semantics, accompanied by an inference system for proving that an object satisfies a specification. The inference system incorporates, but is not limited to, a clearly identified t ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
A specification formalism with parameterisation of an arbitrary order is presented. It is given a denotationalstyle semantics, accompanied by an inference system for proving that an object satisfies a specification. The inference system incorporates, but is not limited to, a clearly identified typechecking component. Special effort is made to carefully distinguish between parameterised specifications, which denote functions yielding classes of objects, and specifications of parameterised objects, which denote classes of functions yielding objects. To deal with both of these in a uniform framework, it was convenient to view specifications, which specify objects, as objects themselves, and to introduce a notion of a specification of specifications. The formalism includes the basic specificationbuilding operations of the ASL specification language. This choice, however, is orthogonal to the new ideas presented. The formalism is also institutionindependent, although this iss...
A kernel specication formalism with higherorder parameterisation
"... A specication formalism with parameterisation of an arbitrary order is presented. It is given a denotationalstyle semantics, accompanied by an inference system for proving that an object satises a specication. The inference system incorporates, but is not limited to, a clearly identied typecheckin ..."
Abstract
 Add to MetaCart
A specication formalism with parameterisation of an arbitrary order is presented. It is given a denotationalstyle semantics, accompanied by an inference system for proving that an object satises a specication. The inference system incorporates, but is not limited to, a clearly identied typechecking component. Special eort is made to carefully distinguish between parameterised specications, which denote functions yielding classes of objects, and specications of parameterised objects, which denote classes of functions yielding objects. To deal with both of these in a uniform framework, it was convenient to view specications, which specify objects, as objects themselves, and to introduce a notion of a specication of specications. The formalism includes the basic specicationbuilding operations of the ASL specication language. This choice, however, is orthogonal to the new ideas presented. The formalism is also institutionindependent, although this issue is not explicitly discussed at any length here. 1