Cited in
(34)- ATLAS: automated amortised complexity analysis of self-adjusting data structures
- Automatic functional correctness proofs for functional search trees
- Verified analysis of random binary tree structures
- Netsoft
- ABC
- CFML
- Grail
- ACE
- CAMPY
- Camelot
- AVL trees
- TiML
- Ergodic theory
- CryptHOL
- Flow Networks
- Density Compiler
- PairingHeap
- Skew Heap
- Separation Logic
- QuickSort Cost
- Random BSTs
- Root Balanced Tree
- Splay Tree
- Treaps
- Dune
- Monad normalisation
- Probabilistic_Prime_Tests
- Prpu_Maxflow
- KoAT
- TcT
- Verified analysis of random binary tree structures
- Amortized complexity verified
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits
- Formalizing network flow algorithms: a refinement approach in Isabelle/HOL
This page was built for software: Amortized Complexity
