Run-time complexity bounds using squeezers
From MaRDI portal
Publication:2233463
DOI10.1007/978-3-030-72019-3_12zbMath1473.68046OpenAlexW3136532615MaRDI QIDQ2233463
Noam Rinetzky, Oren Ish-Shalom, Sharon Shoham, Shachar Itzhaky
Publication date: 18 October 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-72019-3_12
Analysis of algorithms and problem complexity (68Q25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- SMT-based model checking for recursive programs
- Putting the squeeze on array programs: loop verification via inductive rank reduction
- Algorithmic analysis of programs with well quasi-ordered domains.
- Complexity and resource bound analysis of imperative programs using difference constraints
- Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
- Amortized Resource Analysis with Polynomial Potential
- SPEED: Symbolic Complexity Bound Analysis
- Mechanical program analysis
- Resource Analysis driven by (Conditional) Termination Proofs
- The size-change principle for program termination
- SPEED
- Termination Analysis with Calling Context Graphs
- Well-structured transition systems everywhere!
This page was built for publication: Run-time complexity bounds using squeezers