Type-based analysis of logarithmic amortised complexity
From MaRDI portal
Recommendations
Cites work
- A combination framework for complexity
- A path order for rewrite systems that compute exponential time functions
- A systematic analysis of splaying
- ABC: algebraic bound computation for loops
- Amortised resource analysis and typed polynomial interpretations
- Amortized complexity verified
- Amortized Computational Complexity
- Amortized resource analysis with polynomial potential. A static inference of polynomial bounds for functional programs
- An overview of Ciao and its design philosophy
- Analysing the complexity of functional programs: higher-order meets first-order
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Asymptotically precise ranking functions for deterministic size-change systems
- Automated amortised resource analysis for term rewrite systems
- Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
- Automatic Static Cost Analysis for Parallel Programs
- Automatic type inference for amortised heap-space analysis
- Closed-form upper bounds in static cost analysis
- Complexity and resource bound analysis of imperative programs using difference constraints
- Decidable inequalities over infinite trees
- Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS
- Exponential automatic amortized resource analysis
- From Shapes to Amortized Complexity
- Mechanically proving termination using polynomial interpretations
- Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs
- Multivariate amortised resource analysis for term rewrite systems
- Multivariate amortized resource analysis
- Non-polynomial worst-case analysis of recursive programs
- Purely Functional Data Structures
- Runtime complexity analysis of logically constrained rewriting
- Self-adjusting binary search trees
- Size-Change Abstraction and Max-Plus Automata
- Static determination of quantitative resource usage for higher-order programs
- Static prediction of heap space usage for first-order functional programs
- The polynomial complexity of vector addition systems with states
- Tight worst-case bounds for polynomial loop programs
- Towards automatic resource bound analysis for OCaml
- Type-based amortized resource analysis with integers and arrays
- Type-based amortized resource analysis with integers and arrays
- Type-based cost analysis for lazy functional languages
- Types and programing languages
- Verification, Model Checking, and Abstract Interpretation
- Verifying procedural programs via constrained rewriting induction
Cited in
(7)- Amortized complexity verified
- Type-Based Complexity Analysis for Fork Processes
- Programming Languages and Systems
- Automated Expected Amortised Cost Analysis of Probabilistic Data Structures
- Amortized complexity verified
- Data-driven runtime complexity analysis
- ATLAS: automated amortised complexity analysis of self-adjusting data structures
This page was built for publication: Type-based analysis of logarithmic amortised complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875895)
