The algebraic specification of abstract data types

Guttag, John V.; Horning, James J.

doi:10.1007/bf00260922

Cited by 414 publications

(104 citation statements)

References 18 publications

Supporting

Mentioning

102

Contrasting

Unclassified

Order By: Relevance

“…We shall not describe the method of algebraic specification in detail (the interested reader is referred to [8], [9]) but we can illustrate it, and the syntax we shall be using, by deirming a simple data type.…”

Section: Algebraic Specificationmentioning

confidence: 99%

“…We shall attempt to do so in this paper, using an algebraically specified communication environment in which the components of the distributed or concurrent program are defined as modules. The environment will be defined by a set of operations whose semantics are described by axioms; algebraic specification of this form has been used for defining abstract data types (e.g., Gognen, Thatcher and Wagner [8], and Guttag and Homing [9]), so we could consider this environment to be a 'communication data type' [3].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Algebraic specification of a communication scheduler

Joseph

Moitra

1985

Formal Methods and Software Development

View full text Add to dashboard Cite

A distributed programming language normally incorporates one mechanism by which processes communicate with each other. This mechanism can be used to transfer information or to synchronize the flow of control in the program. Different communication mechanisms have been proposed for different languages. In this paper, we provide a common framework in which these mechanisms can be examined independently of the languages in which they may be embedded. Operationally, this framework is a communication scheduler : formally, it is specified Mgebraically as a data type. A number of different communication mechanisms, such as synchronous and asynchronous message passing, broadcasts and remote procedure calls, are modelled and, as an illustration of how global properties can be analysed, we consider the problem of deadlock detection.

show abstract

Section: Algebraic Specificationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Algebraic specification of a communication scheduler

Joseph

Moitra

1985

Formal Methods and Software Development

View full text Add to dashboard Cite

show abstract

“…The code for the case studies and smaller examples, which has been successfully evaluated by the ECOOP artifact evaluation committee, is published online at: the algebra [37]. In ExpAlg the methods Lit and Add represent the constructors of the abstract algebra, which create values of the algebra in the carrier type E. A class that implements such an interface is an algebra [22], in that it defines a concrete representation for the carrier set and concrete implementations of the methods. While it is possible to define an object algebra where the carrier set is instantiated to a primitive type, e.g.…”

Section: Introductionmentioning

confidence: 99%

Feature-Oriented Programming with Object Algebras

Oliveira

Storm

Loh

et al. 2013

ECOOP 2013 – Object-Oriented Programming

View full text Add to dashboard Cite

Abstract. Object algebras are a new programming technique that enables a simple solution to basic extensibility and modularity issues in programming languages. While object algebras excel at defining modular features, the composition mechanisms for object algebras (and features) are still cumbersome and limited in expressiveness. In this paper we leverage two well-studied type system features, intersection types and type-constructor polymorphism, to provide object algebras with expressive and practical composition mechanisms. Intersection types are used for defining expressive run-time composition operators (combinators) that produce objects with multiple (feature) interfaces. Type-constructor polymorphism enables generic interfaces for the various object algebra combinators. Such generic interfaces can be used as a type-safe front end for a generic implementation of the combinators based on reflection. Additionally, we also provide a modular mechanism to allow different forms of self -references in the presence of delegation-based combinators. The result is an expressive, type-safe, dynamic, delegation-based composition technique for object algebras, implemented in Scala, which effectively enables a form of Feature-Oriented Programming using object algebras.

show abstract

“…In the area of abstract data types (ADT) the "isoinitial model" approach [2,3,4] based on (classical) model theory, has been proposed with two aims: to provide a simple treatment of the recursiveness problem and to allow ADT specifications less restrictive than the "algebraic" ones [6,10,12].…”

Section: Introductionmentioning

confidence: 99%

“…The requirements of DEF.2 are analogous to the safety conditions required to preserve "sufficient completeness" in the algebraic attitude [12].…”

mentioning

confidence: 99%