AbstractFrom the standpoint of the final (or terminal) algebra semantics of algebraic specifications, this paper considers the problem of deciding, for a given specification of an abstract data type, whether it is a data type extension. It is shown that the problem is undecidable, but there exists a large class of specifications which are data type extensions
AbstractWe introduce an algebraic construction for the Hausdorff extension H(A) of a many-sorted uni...
It has been proved to be very useful and necessary to give formal specifications of software systems...
AbstractA constructive method for abstract algebraic software specification is presented, where the ...
AbstractA formal framework is proposed for discussing the algebraic properties of data types. In par...
AbstractWe consider the problem of data type extensions. Guttag, Horowitz, and Musser have pointed o...
AbstractAn extensive survey is given of the properties of various specification mechanisms based on ...
The following fundamental theorem about the adequacy of the algebraic specification methods for data...
We compare two methods for software specification: algebraic specifications and automata. While al...
Existing approaches to semantics of algebraically specified data types such as Initial Algebra Seman...
AbstractThis paper discusses a new specification method for algebraic data types consisting of an al...
International audienceAlgebraic specifications of data types provide a natural basis for testing dat...
Abstract. In this paper we investigate formally the relationship between the notion of abstract data...
Most modern programming languages allow the user to define abstract data types, thereby creating an ...
The synthesis of imperative programs for hierarchical, algebraically specified abstract data types i...
Our purpose is to formalize two potential refinements of single-sorted algebraic data types – subalg...
AbstractWe introduce an algebraic construction for the Hausdorff extension H(A) of a many-sorted uni...
It has been proved to be very useful and necessary to give formal specifications of software systems...
AbstractA constructive method for abstract algebraic software specification is presented, where the ...
AbstractA formal framework is proposed for discussing the algebraic properties of data types. In par...
AbstractWe consider the problem of data type extensions. Guttag, Horowitz, and Musser have pointed o...
AbstractAn extensive survey is given of the properties of various specification mechanisms based on ...
The following fundamental theorem about the adequacy of the algebraic specification methods for data...
We compare two methods for software specification: algebraic specifications and automata. While al...
Existing approaches to semantics of algebraically specified data types such as Initial Algebra Seman...
AbstractThis paper discusses a new specification method for algebraic data types consisting of an al...
International audienceAlgebraic specifications of data types provide a natural basis for testing dat...
Abstract. In this paper we investigate formally the relationship between the notion of abstract data...
Most modern programming languages allow the user to define abstract data types, thereby creating an ...
The synthesis of imperative programs for hierarchical, algebraically specified abstract data types i...
Our purpose is to formalize two potential refinements of single-sorted algebraic data types – subalg...
AbstractWe introduce an algebraic construction for the Hausdorff extension H(A) of a many-sorted uni...
It has been proved to be very useful and necessary to give formal specifications of software systems...
AbstractA constructive method for abstract algebraic software specification is presented, where the ...
DOI
Add to ORKG