Cited in
(16)- For a few dollars more. Verified fine-grained algorithm analysis down to LLVM
- ATLAS: automated amortised complexity analysis of self-adjusting data structures
- Synthesis with asymptotic resource bounds
- Relational cost analysis in a functional-imperative setting
- ABC
- Ctrl
- ACE
- Amortized Complexity
- Landau Symbols
- Median-of-Medians
- Auto2_Imperative_HOL
- TcT
- Verifying asymptotic time complexity of imperative programs in Isabelle
- Type-based analysis of logarithmic amortised complexity
- Runtime complexity analysis of logically constrained rewriting
- Denotational semantics as a foundation for cost recurrence extraction for functional languages
This page was built for software: TiML
