Demonic non-determinism

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

A term which describes the execution of a non-deterministic program where all choices that are made favour non-termination.[citation needed]


Wirsing, M.; Broy, M. (5 March 1981). "On the algebraic specification of nondeterministic programming languages". CAAP '81. Springer, Berlin, Heidelberg: 162–179. doi:10.1007/3-540-10828-9_61.

McIver, A. K.; Morgan, Carroll (6 September 2001). "Partial correctness for probabilistic demonic programs". Theoretical Computer Science. 266 (1): 513–541. doi:10.1016/S0304-3975(00)00208-5. ISSN 0304-3975.

Retrieved from ""
This content was retrieved from Wikipedia :
This page is based on the copyrighted Wikipedia article "Demonic non-determinism"; it is used under the Creative Commons Attribution-ShareAlike 3.0 Unported License (CC-BY-SA). You may redistribute it, verbatim or modified, providing that you comply with the terms of the CC-BY-SA