Results 1 
4 of
4
On Observational Equivalence and Algebraic Specification
, 1987
"... The properties of a simple and natural notion of observational equivalence of algebras and the corresponding specificationbuilding operation are studied. We begin with a defmition of observational equivalence which is adequate to handle reachable algebras only, and show how to extend it to cope wit ..."
Abstract

Cited by 66 (17 self)
 Add to MetaCart
The properties of a simple and natural notion of observational equivalence of algebras and the corresponding specificationbuilding operation are studied. We begin with a defmition of observational equivalence which is adequate to handle reachable algebras only, and show how to extend it to cope with unreachable algebras and also how it may be generalised to make sense under an arbitrary institution. Behavioural equivalence is treated as an important special case of observational equivalence, and its central role in program development is shown by means of an example.
A new semantics for Clear
"... Summary. A semantics for the Clear specification language is given. The language of set theory is employed to present constructions corresponding to Clear's specificationcombining operations, which are then used as the basis for a denotational semantics. This is in contrast to Burstall and Goguen's ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Summary. A semantics for the Clear specification language is given. The language of set theory is employed to present constructions corresponding to Clear's specificationcombining operations, which are then used as the basis for a denotational semantics. This is in contrast to Burstall and Goguen's 1980 semantics which described the meanings of these operations
Parameterized Recursion Theory  A Tool for the Systematic Classification of Specification Methods
 Proceedings of the Third International Conference on Algebraic Methodology and Software Technology, 1993, Workshops in Computing
"... We examine four specification methods with increasing expressiveness. Parameterized recursion theory allows to characterize the power of parameterization in the methods, using a computational model based on Moschovakis' search computability. The four specification methods can be characterized by fou ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We examine four specification methods with increasing expressiveness. Parameterized recursion theory allows to characterize the power of parameterization in the methods, using a computational model based on Moschovakis' search computability. The four specification methods can be characterized by four different notions of semicomputable parameterized abstract data type, which differ in the availability of the parameter algebra and of nondeterminism. These characterizations further lead to different algebraic properties of specifiable PADTs. Together with example PADTs, they enable us to prove a hierarchy theorem. Given a sample PADT, the algebraic properties help to find out the lowest position (= most restricted method) in the hierarchy usable to specify it. This is important because the available tools may become weaker, if we choose a too general method.
AUTOMATIC PROGRAMMING USING ABSTRACT DATA TYPES
"... In this paper we first try to characterize one meaning of automatic programming. We consider it to be one part of the Programming environment related to Artificial Intelligence techniques. We then illustrate an automatic programning process, on a simple example, using an Abstract Data Type theory to ..."
Abstract
 Add to MetaCart
In this paper we first try to characterize one meaning of automatic programming. We consider it to be one part of the Programming environment related to Artificial Intelligence techniques. We then illustrate an automatic programning process, on a simple example, using an Abstract Data Type theory to which we add the not ion of schemes which are Type decomposition. We conclude that all the concepts treated in this paper must be contained in one way or another in any automatic programming system. However this necessitates further study in such theoretical fields as Abstract Data