While-programs with nondeterministic assignments and the logic ALNA
Open Access
- 31 December 1985
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 40, 211-235
- https://doi.org/10.1016/0304-3975(85)90167-7
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Countable nondeterminism and random assignmentJournal of the ACM, 1986
- Looping vs. repeating in dynamic logicInformation and Control, 1982
- A Weaker Precondition for LoopsACM Transactions on Programming Languages and Systems, 1982
- Proving total correctness of nondeterministic programs in infinitary logicActa Informatica, 1981
- A proof of the completeness theorem of GrödelFundamenta Mathematicae, 1950