Final Data Types and Their Specification
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Algorithms + Data Structures = Programs
Algorithms + Data Structures = Programs
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
A Discipline of Programming
Nondeterminism in Abstract Data Types
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Universal Realization, Persistent Interconnection and Implementation of Abstract Modules
Proceedings of the 9th Colloquium on Automata, Languages and Programming
A Kernel Language for Algebraic Specification and Implementation - Extended Abstract
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
TOWARDS A THEORY FOR ABSTRACT DATA TYPES
TOWARDS A THEORY FOR ABSTRACT DATA TYPES
Referential opacity in nondeterministic data refinement
ACM Letters on Programming Languages and Systems (LOPLAS)
A complete calculus for the multialgebraic and functional semantics of nondeterminism
ACM Transactions on Programming Languages and Systems (TOPLAS)
Algebraic approaches to nondeterminism—an overview
ACM Computing Surveys (CSUR)
A functorial semantics for multi-algebras and partial algebras, with applications to syntax
Theoretical Computer Science
Structured specifications and implementation of nondeterministic data types
Nordic Journal of Computing
Convergent approximate solving of first-order constraints by approximate quantifiers
ACM Transactions on Computational Logic (TOCL)
A complete axiomatic semantics of spawning
Distributed Computing
An Approach to Nondeterminism in Translation of CZ Set Theory into Martin-Löf 's Theory of Types
Electronic Notes in Theoretical Computer Science (ENTCS)
Alternating states for dual nondeterminism in imperative programming
Theoretical Computer Science
Non-deterministic algebraic structures for soft computing
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
Bireachability and final multialgebras
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
| Hi-index | 0.00 |
The theory of abstract data types is generalized to the case of nondeterministic operations (set-valuedfunctions). Since the nondeterminism of operations may be coupled, signatures are extended so that operations can have results in Cartesian products. Input/output behavior is used to characterize implementation of one model by another. It is described by means of accumulated arrows, which form a generalization of the term algebra. Morphisms of nondeterministic models are introduced. Both innovations prove to be powerful tools in the analysis of input/output behavior. Extraction equivalence and observable equivalence of values are investigated. Quotient models for such equivalence relations are constructed. The equivalence relations are compared with each other, with separation of values by means of experiments, and with the separation property that characterizes a terminal model. Examples are given to show that the four concepts are different. In deterministic models the concepts coincide.