ATLAS: automated amortised complexity analysis of self-adjusting data structures
From MaRDI portal
Publication:832253
DOI10.1007/978-3-030-81688-9_5zbMATH Open1493.68129OpenAlexW3181653342MaRDI QIDQ832253FDOQ832253
Authors: Lorenz Leutgeb, Georg Moser, Florian Zuleger 
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81688-9_5
Recommendations
functional programmingautomationself-adjusting data structuresconstraint solvingamortised cost analysis
Cites Work
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- A combination framework for complexity
- Analysing the complexity of functional programs: higher-order meets first-order
- Automated Complexity Analysis Based on the Dependency Pair Method
- Self-adjusting binary search trees
- Automatic type inference for amortised heap-space analysis
- Multivariate amortized resource analysis
- Title not available (Why is that?)
- Verifying Nonlinear Real Formulas Via Sums of Squares
- Title not available (Why is that?)
- Boolean lexicographic optimization: algorithms \& applications
- Purely Functional Data Structures
- An overview of Ciao and its design philosophy
- Closed-form upper bounds in static cost analysis
- Amortized Computational Complexity
- Decidable inequalities over infinite trees
- A systematic analysis of splaying
- Static prediction of heap space usage for first-order functional programs
- Towards automatic resource bound analysis for OCaml
- Amortized complexity verified
- Automated amortised resource analysis for term rewrite systems
- Runtime complexity analysis of logically constrained rewriting
- Non-polynomial worst-case analysis of recursive programs
- The polynomial complexity of vector addition systems with states
- Complexity and resource bound analysis of imperative programs using difference constraints
- Type-based cost analysis for lazy functional languages
- Size-Change Abstraction and Max-Plus Automata
- A linear potential function for pairing heaps
- From Shapes to Amortized Complexity
- Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS
- Amortised resource analysis and typed polynomial interpretations
- Multivariate amortised resource analysis for term rewrite systems
- Verifying procedural programs via constrained rewriting induction
Cited In (4)
Uses Software
This page was built for publication: ATLAS: automated amortised complexity analysis of self-adjusting data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832253)
