Two decades of automatic amortized resource analysis
From MaRDI portal
Publication:5875892
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
- scientific article; zbMATH DE number 3910392 (Why is no real title available?)
- scientific article; zbMATH DE number 1398002 (Why is no real title available?)
- scientific article; zbMATH DE number 7204445 (Why is no real title available?)
- A lambda-calculus foundation for universal probabilistic programming
- A provable time and space efficient implementation of NESL
- A type system for bounded space and functional in-place update
- Amortised Memory Analysis Using the Depth of Data Structures
- Amortised resource analysis for object-oriented programs
- Amortised resource analysis with separation logic
- Amortized Computational Complexity
- Amortized resource analysis with polynomial potential. A static inference of polynomial bounds for functional programs
- Automated resource analysis with Coq proof objects
- Automatic Space Bound Analysis for Functional Programs with Garbage Collection
- Automatic Static Cost Analysis for Parallel Programs
- Automatic amortised analysis of dynamic memory allocation for lazy functional programs
- BI as an assertion language for mutable data structures
- Decidable inequalities over infinite trees
- Decidable linear list constraints
- Efficient Type-Checking for Amortised Heap-Space Analysis
- Exponential automatic amortized resource analysis
- Linear types and non-size-increasing polynomial time computation.
- Multivariate amortized resource analysis
- Polarized Substructural Session Types
- Practical foundations for programming languages
- Programming Languages and Systems
- Purely Functional Data Structures
- Quantitative reasoning for proving lock-freedom
- Static determination of quantitative resource usage for higher-order programs
- Static prediction of heap space usage for first-order functional programs
- The strength of non-size increasing computation
- Towards automatic resource bound analysis for OCaml
- Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages
- Type-based cost analysis for lazy functional languages
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits
- Work analysis with resource-aware session types
Cited in
(4)
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)
