Non-polynomial worst-case analysis of recursive programs

DOI10.1007/978-3-319-63390-9_3zbMath1494.68053arXiv1705.00317OpenAlexW3141205758MaRDI QIDQ2164209

Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee

Publication date: 12 August 2022

Full work available at URL: https://arxiv.org/abs/1705.00317

zbMATH Keywords

recursive programsworst-case boundFLO11 expressiontemplate variablestriple constraint

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (6)

ATLAS: automated amortised complexity analysis of self-adjusting data structures ⋮ What else is undecidable about loops? ⋮ Time-bounded termination analysis for probabilistic programs with delays ⋮ Deciding Fast Termination for Probabilistic VASS with Nondeterminism ⋮ Type-based analysis of logarithmic amortised complexity ⋮ Runtime complexity analysis of logically constrained rewriting

This page was built for publication: Non-polynomial worst-case analysis of recursive programs