Pages that link to "Item:Q1825630"
From MaRDI portal
The following pages link to Is ``Some-other-time'' sometimes better than ``Sometime'' for proving partial correctness of programs? (Q1825630):
Displaying 6 items.
- Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics (Q687278) (← links)
- Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs (Q1071491) (← links)
- Taming logic (Q1909607) (← links)
- A logical study of group-size based social network creation (Q2423774) (← links)
- Derivation rules as anti-axioms in modal logic (Q4276034) (← links)
- Does “N+1 times” prove more programs correct than “N times”? (Q5887528) (← links)
