Abstract
AbstractThis article gives an overview of automatic amortized resource analysis (AARA), a technique for inferring symbolic resource bounds for programs at compile time. AARA has been introduced by Hofmann and Jost in 2003 as a type system for deriving linear worst-case bounds on the heap-space consumption of first-order functional programs with eager evaluation strategy. Since then AARA has been the subject of dozens of research articles, which extended the analysis to different resource metrics, other evaluation strategies, non-linear bounds, and additional language features. All these works preserved the defining characteristics of the original paper: local inference rules, which reduce bound inference to numeric (usually linear) optimization; a soundness proof with respect to an operational cost semantics; and the support of amortized analysis with the potential method.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference68 articles.
1. Hoffmann, J. (2011). Types with Potential: Polynomial Resource Bounds via Automatic Amortized Analysis. Phd thesis, Ludwig-Maximilians-Universität München.
2. Jost, S. (2010). Automated Amortised Analysis. Phd thesis, Faculty of Mathematics, Computer Science and Statistics, LMU Munich, Germany, September 2010.
3. Time Credits and Time Receipts in Iris
4. Programming languages capturing complexity classes
5. Borgström, J. , Dal Lago, U. , Gordon, A. D. and Szymczak, M. (2016). A lambda-calculus foundation for universal probabilistic programming. In: International Conference on Functional Programming (ICFP’16).
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Polynomial Time and Dependent Types;Proceedings of the ACM on Programming Languages;2024-01-05
2. A Calculus for Amortized Expected Runtimes;Proceedings of the ACM on Programming Languages;2023-01-09
3. A Reusable Machine-Calculus for Automated Resource Analyses;Logic-Based Program Synthesis and Transformation;2023