Pages that link to "Item:Q1162355"
From MaRDI portal
The following pages link to Programs and program verifications in a general setting (Q1162355):
Displayed 15 items.
- Total correctness in nonstandard logics of programs (Q580955) (← links)
- A simple proof for the completeness of Floyd's method (Q801661) (← links)
- On the strength of temporal proofs (Q809066) (← links)
- Non-standard algorithmic and dynamic logic (Q1077159) (← links)
- On the programs-as-formulas interpretation of parallel programs in Peano arithmetic (Q1100878) (← links)
- Weak second order characterizations of various program verification systems (Q1124311) (← links)
- A complete logic for reasoning about programs via nonstandard model theory. I (Q1159460) (← links)
- A complete logic for reasoning about programs via nonstandard model theory. II (Q1159461) (← 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)
- A faithful embedding of parallel computations in star-finite models (Q1825641) (← links)
- Program correctness on finite fields (Q2563951) (← links)
- Recursive programs and denotational semantics in absolute logics of programs (Q2639051) (← links)
- Inductive Completeness of Logics of Programs (Q2804944) (← links)
- On the Completeness of Dynamic Logic (Q3617722) (← links)