Pages that link to "Item:Q3341880"

The following pages link to On the strength of “sometimes” and “always” in program verification (Q3341880):

Displaying 8 items.

• ``A la Burstall'' intermittent assertions induction principles for proving inevitability properties of programs (Q689297) (← 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)
• Comments on ''Always-true is not invariant'': Assertional reasoning about invariance (Q1183477) (← links)
• Hoare's logic for nondeterministic regular programs: A nonstandard approach (Q1822934) (← links)
• Is ``Some-other-time'' sometimes better than ``Sometime'' for proving partial correctness of programs? (Q1825630) (← links)
• Recursive programs and denotational semantics in absolute logics of programs (Q2639051) (← links)
• Does “N+1 times” prove more programs correct than “N times”? (Q5887528) (← links)