The following pages link to (Q4726228):
Displaying 8 items.
- Total correctness in nonstandard logics of programs (Q580955) (← links)
- Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics (Q687278) (← links)
- On the strength of temporal proofs (Q809066) (← links)
- A simple dynamic logic (Q1087866) (← links)
- Weak second order characterizations of various program verification systems (Q1124311) (← links)
- Temporal logics need their clocks (Q1186428) (← 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)
