From Shapes to Amortized Complexity
Abstract elided by the publisher.
Related papers
- Lightweight Testing of Persistent Amortized Time Complexity in the Credit Monad Haskell 2025
- Liquid Amortization: Proving Amortized Complexity with LiquidHaskell (Functional Pearl) Haskell 2024
- A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis CAV 2014
- Selectively-Amortized Resource Bounding SAS 2021
- The Shape of Things to Run - Compiling Complex Stream Graphs to Reconfigurable Hardware in Lime ECOOP 2013
- Type-guided worst-case input generation POPL 2019
- For a Few Dollars More: Verified Fine-Grained Algorithm Analysis Down to LLVM TOPLAS 2022
- Denotational recurrence extraction for amortized analysis ICFP 2020