Pages that link to "Item:Q800082"
From MaRDI portal
The following pages link to Expressiveness and the completeness of Hoare's logic (Q800082):
Displaying 19 items.
- Completeness for recursive procedures in separation logic (Q278747) (← links)
- Proving program inclusion using Hoare's logic (Q789887) (← links)
- Average case optimality for linear problems (Q796299) (← links)
- The axiomatic semantics of programs based on Hoare's logic (Q800712) (← links)
- Weakly expressive models for Hoare logic (Q805248) (← links)
- Completeness of Hoare logic with inputs over the standard model (Q896915) (← links)
- Semantical analysis of specification logic (Q913527) (← links)
- Hoare's logic for programming languages with two data types (Q1056220) (← links)
- Some questions about expressiveness and relative completeness in Hoare's logic (Q1064046) (← links)
- Algebraic specifications of computable and semicomputable data types (Q1098613) (← links)
- Some general incompleteness results for partial correctness logics (Q1110500) (← links)
- Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs (Q1163369) (← links)
- The verification of modules (Q1329200) (← links)
- The \(\mathbf{M}\)-computations induced by accessibility relations in nonstandard models \(\mathbf{M}\) of Hoare logic (Q1712495) (← links)
- On the notion of expressiveness and the rule of adaptation (Q1838825) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- Completeness and expressiveness of pointer program verification by separation logic (Q2417849) (← links)
- Completeness of Hoare Logic Relative to the Standard Model (Q2971129) (← links)
- First order Büchi automata and their application to verification of LTL specifications (Q6643476) (← links)
