Two decades of automatic amortized resource analysis
From MaRDI portal
Publication:5875892
DOI10.1017/S0960129521000487OpenAlexW4220906786MaRDI QIDQ5875892FDOQ5875892
Publication date: 6 February 2023
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129521000487
Recommendations
- Type-based amortized resource analysis with integers and arrays
- Type-based amortized resource analysis with integers and arrays
- Amortized resource analysis with polynomial potential. A static inference of polynomial bounds for functional programs
- Towards automatic resource bound analysis for OCaml
- Amortised resource analysis for object-oriented programs
Cites Work
- A provable time and space efficient implementation of NESL
- Title not available (Why is that?)
- BI as an assertion language for mutable data structures
- Linear types and non-size-increasing polynomial time computation.
- Multivariate amortized resource analysis
- Practical foundations for programming languages
- Purely Functional Data Structures
- Title not available (Why is that?)
- Amortized Computational Complexity
- Decidable Inequalities over Infinite Trees
- Automated resource analysis with Coq proof objects
- A type system for bounded space and functional in-place update
- Static prediction of heap space usage for first-order functional programs
- Amortised resource analysis with separation logic
- Amortized resource analysis with polynomial potential. A static inference of polynomial bounds for functional programs
- Quantitative Reasoning for Proving Lock-Freedom
- Towards automatic resource bound analysis for OCaml
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits
- The strength of non-size increasing computation
- Exponential automatic amortized resource analysis
- Type-based cost analysis for lazy functional languages
- Automatic Static Cost Analysis for Parallel Programs
- Efficient Type-Checking for Amortised Heap-Space Analysis
- Static determination of quantitative resource usage for higher-order programs
- Programming Languages and Systems
- Amortised Memory Analysis Using the Depth of Data Structures
- Polarized Substructural Session Types
- A lambda-calculus foundation for universal probabilistic programming
- Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages
- Title not available (Why is that?)
- Automatic Space Bound Analysis for Functional Programs with Garbage Collection
- Work Analysis with Resource-Aware Session Types
- Automatic amortised analysis of dynamic memory allocation for lazy functional programs
- Decidable linear list constraints
- Title not available (Why is that?)
Cited In (1)
Uses Software
This page was built for publication: Two decades of automatic amortized resource analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875892)
