Alternating states for dual nondeterminism in imperative programming
From MaRDI portal
Publication:974118
DOI10.1016/j.tcs.2010.03.016zbMath1208.68107OpenAlexW2123443277MaRDI QIDQ974118
Publication date: 27 May 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://pure.rug.nl/ws/files/2576371/2010ThCompSciHesselink.pdf
refinement calculusnondeterminismprogramming semanticsangelic choicedemonic choicefree distributive completion
Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Terms with unbounded demonic and angelic nondeterminacy
- Data refinement by calculation
- Duality in specification languages: A lattice-theoretical approach
- Dual unbounded nondeterminacy, recursion, and fixpoints
- The free completely distributive lattice over a poset
- Interpretations of recursion under unbounded nondeterminacy
- LR-parsing derived
- Nondeterminacy and recursion via stacks and games
- Predicate transformers for recursive procedures with local variables
- DUALITY: A simple formalism for the analysis of UNITY
- Countable nondeterminism and random assignment
- Alternation
- A Weaker Precondition for Loops
- Guarded commands, nondeterminacy and formal derivation of programs
- Refinement Calculus
- A mathematical approach to nondeterminism in data types
- Programming as a Discipline of Mathematical Nature
- Mathematics of Program Construction
- Mathematics of Program Construction
- An axiomatic basis for computer programming
- The complexity of theorem-proving procedures
- Theory and Applications of Relational Structures as Knowledge Instruments
