Pages that link to "Item:Q2945628"
From MaRDI portal
The following pages link to Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation (Q2945628):
Displayed 11 items.
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits (Q670699) (← links)
- Amortized complexity verified (Q670702) (← links)
- Formalizing network flow algorithms: a refinement approach in Isabelle/HOL (Q1722647) (← links)
- Refinement to imperative HOL (Q1739909) (← links)
- A Coq Library for Internal Verification of Running-Times (Q2798271) (← links)
- Amortized Complexity Verified (Q2945642) (← links)
- Verified Characteristic Formulae for CakeML (Q2988660) (← links)
- Relational cost analysis in a functional-imperative setting (Q5020903) (← links)
- Verified Root-Balanced Trees (Q5056001) (← links)
- The Negligible and Yet Subtle Cost of Pattern Matching (Q5056004) (← links)
- Characteristic formulae for liveness properties of non-terminating CakeML programs (Q5875446) (← links)