The following pages link to (Q4823141):
Displaying 16 items.
- Theory exploration powered by deductive synthesis (Q832255) (← links)
- Reasoning about actions with loops via Hoare logic (Q1712544) (← links)
- An algebraic framework for minimum spanning tree problems (Q1786562) (← links)
- Verifying minimum spanning tree algorithms with Stone relation algebras (Q1994364) (← links)
- Flexible proof production in an industrial-strength SMT solver (Q2104495) (← links)
- Verifying graph programs with monadic second-order logic (Q2117269) (← links)
- Relational characterisations of paths (Q2210868) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- GRUNGE: a grand unified ATP challenge (Q2305410) (← links)
- Towards bit-width-independent proofs in SMT solvers (Q2305428) (← links)
- A formally verified abstract account of Gödel's incompleteness theorems (Q2305432) (← links)
- A program logic for resources (Q2463560) (← links)
- Probabilistic guarded commands mechanized in HOL (Q2576950) (← links)
- Second-order properties of undirected graphs (Q2695354) (← links)
- Relation-algebraic verification of Borůvka's minimum spanning tree algorithm (Q2695356) (← links)
- Completeness of Hoare Logic Relative to the Standard Model (Q2971129) (← links)
