Programming with angelic nondeterminism
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
This paper extends correctness and refinement reasoningmethods in order to show how angelic nondeterminismcan be systematically transformed into demonic nondeterminismor determinism. This kind of transformation is importantbecause angelic nondeterminism assumes that thechoices will be resolved intelligently by an agent interestedin establishing the postcondition. When angelic nondeterminismis reduced into demonic nondeterminism or determinism,such intelligent choices are no longer necessary.Reducing angelic nondeterminism is generally not a refinement;however, when context is taken into consideration, itcan be a correctness-preserving transformation.