SPEED: Symbolic Complexity Bound Analysis

DOI10.1007/978-3-642-02658-4_7MaRDI QIDQ3636853zbMATH OpenOpenAlexFDO

Authors Sumit Gulwani

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

Mathematics Subject Classification ID

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

Recommendations

• SPEED: precise and efficient static estimation of program computational complexity
• Complexity of computer computations. Proceedings of a symposium on the complexity of computer computations, held March 20--22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, and sponsored by the Office of Naval Research, ma
• A flow calculus of \(mwp\)-bounds for complexity analysis
• Quantitative aspects of speed-up and gap phenomena
• Quantitative Aspects of Speed-Up and Gap Phenomena

Cited in

(10)

• scientific article; zbMATH DE number 7649967 (Why is no real title available?)
• An abstract domain to infer symbolic ranges over nonnegative parameters
• Linear dependent types in a call-by-value scenario
• Run-time complexity bounds using squeezers
• Runtime complexity analysis of logically constrained rewriting
• A type-based complexity analysis of object oriented programs
• Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution
• Convex invariant refinement by control node splitting: a heuristic approach
• SPEED: precise and efficient static estimation of program computational complexity
• \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs

This page was built for publication: SPEED: Symbolic Complexity Bound Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3636853)