Semantics of nondeterministic and noncontinuous constructs-Reference-Cited by-同舟云学术

Semantics of nondeterministic and noncontinuous constructs

Published: Issue: Volume: Page:553-592
ISSN:
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Broy M.,Gnatz R.,Wirsing M.

Publisher

Springer-Verlag

Link

http://www.springerlink.com/index/pdf/10.1007/BFb0014683

Reference32 articles.

1. W. Ackermann: Die Widerspruchsfreiheit des Auswahlaxioms. Göttinger Wiss. Nachrichten, Math.-Phys. Klasse, 246–250, 1924

2. J. A. Goguen, J. W. Thatcher, E. G. Wagner: An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types. IBM Research Report RC — 6487, 1976

3. A. Arnold, M. Nivat: Non Deterministic Recursiv Schemes. Fundamentals of Computation Theory. Poznan 1977. Lecture Notes in Computer Science 56, 12–21, 1977

4. A. Arnold: Schémas de programmes récursifs non déterministes avec appel "synchrone". Laboratoire de Calcul, Université des Sciences et Techniques de Lille, Publication NO 105, 1978

5. F. L. Bauer, H. Wössner, H. Partsch, P. Pepper: Algorithmische Sprachen. Vorlesungsskriptum, Technische Universität München 1977, Kap. 1

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Axioms for signatures with domain and demonic composition;Algebra universalis;2021-03-21

2. Connecting Fixpoints of Computations with Strict Progress;Unifying Theories of Programming;2019

3. Logical Relations and Nondeterminism;Software, Services, and Systems;2015

4. A Homage to Martin Wirsing;Software, Services, and Systems;2015

5. Unifying Correctness Statements;Lecture Notes in Computer Science;2012