Structured specifications and implementation of nondeterministic data types

Authors:
Michal Walicki;Manfred Broy
Affiliations:
Universitetet i Bergen, Institutt for Informatikk, HiB, 5020 Bergen, Norway;Technische Universität München, Institut für Informatik, Arcisstr. 21, 80290 München, Germany
Venue:
Nordic Journal of Computing
Year:
1995

Citing 16
Cited 2

A mathematical approach to nondeterminism in data types

ACM Transactions on Programming Languages and Systems (TOPLAS)
Toward formal development of programs from algebraic specifications: implementations revisited

Acta Informatica
Unified algebras and institutions

Proceedings of the Fourth Annual Symposium on Logic in computer science
Conditional rewriting logic as a unified model of concurrency

Selected papers of the Second Workshop on Concurrency and compositionality
Functional specification of time-sensitive communicating systems

ACM Transactions on Software Engineering and Methodology (TOSEM)
Nondeterminism in algebraic specifications and algebraic programs

Nondeterminism in algebraic specifications and algebraic programs
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)
Multialgebras, Power Algebras and Complete Calculi of Identities and Inclusions

Selected papers from the 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop on Recent Trends in Data Type Specification
Nondeterminism in Abstract Data Types

Proceedings of the 8th Colloquium on Automata, Languages and Programming
Generated Models and the omega-Rule: The Nondeterministic Case

TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Pers as Types, Inductive Types and Types with Laws

Seminar and Workshop on Declarative Programming
Reasoning and Rewriting with Set-Relations I: Ground Completeness

CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
On the Algebraic Specification of Nondeterministic Programming Languages

CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
Compostional Relational Semantics for Indeterminate Dataflow Networks

Category Theory and Computer Science
(Relational) Programming Laws in the Boom Hierarchy of Types

Proceedings of the Second International Conference on Mathematics of Program Construction

Algebraic approaches to nondeterminism—an overview

ACM Computing Surveys (CSUR)
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)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The use of nondeterminism in specifications, as distinct from under-specification is motivated by an example in the context of data refinement. A simple formalism for specifying nondeterministic data types is introduced. Its semantics is given in terms of the existing formalisms of relations, multialgebras, sets of functions and oracles by means of appropriate translation rules. Nondeterministic data refinement is studied from the syntactic and semantic perspective, and the correctness of the suggested proof obligations is proved. A more general implementation relation and parameterisation of nondeterministic data types are discussed and the standard theorems of vertical and horizontal composition are generalized to the nondeterministic case.