Run-time complexity bounds using squeezers
From MaRDI portal
Publication:2233463
DOI10.1007/978-3-030-72019-3_12zbMATH Open1473.68046OpenAlexW3136532615MaRDI QIDQ2233463FDOQ2233463
Authors: Oren Ish-Shalom, Shachar Itzhaky, Noam Rinetzky, Sharon Shoham 
Publication date: 18 October 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-72019-3_12
Recommendations
- On the inference of resource usage upper and lower bounds
- Resource analysis of complex programs with cost equations
- More precise yet widely applicable cost analysis
- SPEED: precise and efficient static estimation of program computational complexity
- Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
Analysis of algorithms and problem complexity (68Q25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- The size-change principle for program termination
- SPEED: Symbolic Complexity Bound Analysis
- Algorithmic analysis of programs with well quasi-ordered domains.
- Well-structured transition systems everywhere!
- Termination Analysis with Calling Context Graphs
- SPEED: precise and efficient static estimation of program computational complexity
- Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
- SMT-based model checking for recursive programs
- Mechanical program analysis
- Amortized resource analysis with polynomial potential. A static inference of polynomial bounds for functional programs
- Putting the squeeze on array programs: loop verification via inductive rank reduction
- Complexity and resource bound analysis of imperative programs using difference constraints
- Resource analysis driven by (conditional) termination proofs
Cited In (1)
This page was built for publication: Run-time complexity bounds using squeezers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233463)
