Interpretations of recursion under unbounded nondeterminacy

DOI10.1016/0304-3975(88)90142-9zbMath0663.68016OpenAlexW1996725025WikidataQ127975297 ScholiaQ127975297MaRDI QIDQ1115173

Wim H. Hesselink

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://pure.rug.nl/ws/files/3378932/1988ThCompSciHesselink1.pdf

zbMATH Keywords

operational semanticsdenotational semanticsweakest preconditionsunbounded nondeterminacy

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Safety and progress of recursive procedures, Deadlock and fairness in morphisms of transition systems, Command algebras, recursion and program transformation, Alternating states for dual nondeterminism in imperative programming, Dual unbounded nondeterminacy, recursion, and fixpoints, Relational Semantics Revisited

Cites Work

• Proof rules and transformations dealing with fairness
• Specification-oriented semantics for communicating processes
• Deadlock and fairness in morphisms of transition systems
• Predicative programming Part I
• Countable nondeterminism and random assignment
• Some Properties of Predicate Transformers
• A mathematical approach to nondeterminism in data types
• Programming as a Discipline of Mathematical Nature
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item