Pages that link to "Item:Q801661"
From MaRDI portal
The following pages link to A simple proof for the completeness of Floyd's method (Q801661):
Displayed 8 items.
- Total correctness in nonstandard logics of programs (Q580955) (← links)
- On the strength of temporal proofs (Q809066) (← links)
- Weak second order characterizations of various program verification systems (Q1124311) (← links)
- Hoare's logic for nondeterministic regular programs: A nonstandard approach (Q1822934) (← links)
- Stability of weak second-order semantics (Q1825629) (← links)
- Is ``Some-other-time'' sometimes better than ``Sometime'' for proving partial correctness of programs? (Q1825630) (← links)
- Program correctness on finite fields (Q2563951) (← links)
- Recursive programs and denotational semantics in absolute logics of programs (Q2639051) (← links)