A cook's tour of countable nondeterminism-Reference-Cited by-同舟云学术

A cook's tour of countable nondeterminism

Published:1981 Issue: Volume: Page:479-494
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Apt K. R.,Plotkin G. D.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-10843-2_38.pdf

Reference17 articles.

1. Apt, K.R., Ten Years of Hoare's Logic, A Survey, Part I Fac. of Economics, Univ. of Rotterdam, Technical Report (to appear in TOPLAS), 1979

2. Apt, K.R. and Olderog, E.R., Proof Rules Dealing With Fairness Bericht Nr. uu, Inst. Inf. Prakt. Math., Univ. of Kiel (1981)

3. Back, R.J., Proving Total Correctness of Non-Deterministic Programs in Infinitary Logic, Computing Centre, Univ. of Helsinki, Research Report No. 9 (to appear in Acta Informatica), 1979

4. Back, R.J., Semantics of Unbounded Non-Determinism, in: Proc. 7th Colloquium Automata, Languages and Programming, Lecture Notes in Computer Science 85, Springer-Verlag, pp. 51–63, 1980

5. Boom, H.J., A Weaker Precondition for Loops Mathematisch Centrum Report IW 104/78, 1978

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

1. Linearizability Is Not Always a Safety Property;Networked Systems;2014

2. The origins of structural operational semantics;The Journal of Logic and Algebraic Programming;2004-07

3. Denotational Semantics;Formal Models and Semantics;1990

4. Computations, residuals, and the power of indeterminacy;Automata, Languages and Programming;1988

5. A New Transformational Approach to Partial Correctness Proof Calculi for Algol 6 8-Like Programs with Finite Modes and Simple Sideeffects;Topics in the Theory of Computation, Selected Papers of the International Conference on ‘Foundations of Computation Theory’, FCT '83;1985