Pages that link to "Item:Q2829265"
From MaRDI portal
The following pages link to Automatic Functional Correctness Proofs for Functional Search Trees (Q2829265):
Displaying 7 items.
- Amortized complexity verified (Q670702) (← links)
- An assertional proof of red-black trees using Dafny (Q1984797) (← links)
- Automatic refinement to efficient data structures: a comparison of two approaches (Q2417948) (← links)
- Ready,<tt>Set</tt>, Verify! Applying<tt>hs-to-coq</tt>to real-world Haskell code (Q5018778) (← links)
- Verified Root-Balanced Trees (Q5056001) (← links)
- (Q5875410) (← links)
- Verified analysis of random binary tree structures (Q5919010) (← links)
