The following pages link to Separation Logic (Q40263):
Displaying 8 items.
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits (Q670699) (← links)
- Formalizing network flow algorithms: a refinement approach in Isabelle/HOL (Q1722647) (← links)
- Refinement to imperative HOL (Q1739909) (← links)
- Verifying asymptotic time complexity of imperative programs in Isabelle (Q1799114) (← links)
- For a few dollars more. Verified fine-grained algorithm analysis down to LLVM (Q2233462) (← links)
- Efficient verification of imperative programs using auto2 (Q2324204) (← links)
- Formalizing the Edmonds-Karp Algorithm (Q2829260) (← links)
- Refinement to Imperative/HOL (Q2945637) (← links)
