Credit-based amortized analysis is sound for persistent data structures when credits are stored only on thunks, and Okasaki's debit approach receives a formal operational semantics.
ACM Transactions on Programming Languages and Systems (TOPLAS) , volume =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2roles
background 1polarities
support 1representative citing papers
KoAT implements alternating modular inference of runtime and size bounds for integer programs using a portfolio of techniques and validates the approach via experimental evaluation.
citing papers explorer
-
Persistent Amortised Analysis, Operationally
Credit-based amortized analysis is sound for persistent data structures when credits are stored only on thunks, and Okasaki's debit approach receives a formal operational semantics.
-
KoAT: Automatic Complexity and Termination Analysis of Integer Programs
KoAT implements alternating modular inference of runtime and size bounds for integer programs using a portfolio of techniques and validates the approach via experimental evaluation.