Binary search - think positive
Abstract
The setting is a tutorial on program verification in Agda. Please consult the programme for further details. [ See also Appendix A .]
Related papers
- Statistical similarity of binaries PLDI 2016
- Improving efficacy of internal binary search trees using local recovery PPoPP 2016
- Inductive Synthesis of Inductive Heap Predicates OOPSLA 2025
- A speculation-friendly binary search tree PPoPP 2012
- The MLIR Transform Dialect: Your Compiler Is More Powerful Than You Think CGO 2025
- A fresh look at binary search trees JFP 2002
- CASTLE: fast concurrent internal binary search tree using edge-based locking PPoPP 2015
- Fast concurrent lock-free binary search trees PPoPP 2014