SPEED: Symbolic Complexity Bound Analysis
From MaRDI portal
Publication:3636853
DOI10.1007/978-3-642-02658-4_7zbMath1242.68121OpenAlexW1599625180MaRDI QIDQ3636853
Publication date: 30 June 2009
Published in: Computer Aided Verification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02658-4_7
Analysis of algorithms and problem complexity (68Q25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (9)
\textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs ⋮ An abstract domain to infer symbolic ranges over nonnegative parameters ⋮ A type-based complexity analysis of object oriented programs ⋮ Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution ⋮ Unnamed Item ⋮ Linear dependent types in a call-by-value scenario ⋮ Run-time complexity bounds using squeezers ⋮ Convex Invariant Refinement by Control Node Splitting: a Heuristic Approach ⋮ Runtime complexity analysis of logically constrained rewriting
This page was built for publication: SPEED: Symbolic Complexity Bound Analysis
