Pages that link to "Item:Q794426"
From MaRDI portal
The following pages link to Two theorems about the completeness of Hoare's logic (Q794426):
Displaying 20 items.
- Proving program inclusion using Hoare's logic (Q789887) (← links)
- Partial correctness: The term-wise approach (Q793507) (← links)
- Average case optimality for linear problems (Q796299) (← links)
- Expressiveness and the completeness of Hoare's logic (Q800082) (← links)
- The axiomatic semantics of programs based on Hoare's logic (Q800712) (← links)
- Verification conditions are code (Q855274) (← links)
- Completeness of Hoare logic with inputs over the standard model (Q896915) (← links)
- Some questions about expressiveness and relative completeness in Hoare's logic (Q1064046) (← links)
- The semantics of Hoare's iteration rule (Q1078551) (← links)
- A decomposition rule for the Hoare logic (Q1097683) (← links)
- Some general incompleteness results for partial correctness logics (Q1110500) (← links)
- A language independent proof of the soundness and completeness of generalized Hoare logic (Q1122978) (← links)
- Hoare's logic and Peano's arithmetic (Q1170877) (← links)
- On the completeness of propositional Hoare logic (Q1602554) (← links)
- The \(\mathbf{M}\)-computations induced by accessibility relations in nonstandard models \(\mathbf{M}\) of Hoare logic (Q1712495) (← links)
- Hoare's logic and VDM (Q1805402) (← links)
- Inductive completeness of logics of programs (Q2804944) (← links)
- Relative completeness for logics of functional programs (Q2915704) (← links)
- (Q4606020) (← links)
- Foundations of Software Science and Computation Structures (Q5308458) (← links)
