Pages that link to "Item:Q4144164"
From MaRDI portal
The following pages link to Is “sometime” sometimes better than “always”? (Q4144164):
Displaying 14 items.
- Total correctness in nonstandard logics of programs (Q580955) (← links)
- The Schorr-Waite graph marking algorithm (Q599496) (← links)
- ``A la Burstall'' intermittent assertions induction principles for proving inevitability properties of programs (Q689297) (← links)
- Semantics of algorithmic languages (Q760200) (← links)
- Verifying programs by induction on their data structure: general format and applications (Q1050765) (← links)
- Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs (Q1071491) (← links)
- Non-standard algorithmic and dynamic logic (Q1077159) (← links)
- Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic (Q1139368) (← links)
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II (Q1152704) (← links)
- The correctness of the Schorr-Waite list marking algorithm (Q1250706) (← links)
- On proving the termination of algorithms by machine (Q1341666) (← links)
- Inter-program Properties (Q3392934) (← links)
- (Q4742767) (← links)
- Automated temporal reasoning about reactive systems (Q6560389) (← links)
