The following pages link to (Q3860820):
Displaying 5 items.
- Semantics of algorithmic languages (Q760200) (← links)
- On infinite computations in denotational semantics (Q1051414) (← links)
- Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs (Q1071491) (← links)
- Proving total correctness of nondeterministic programs in infinitary logic (Q1155605) (← links)
- General correctness: A unification of partial and total correctness (Q2265798) (← links)