×

zbMATH — the first resource for mathematics

SPEED: symbolic complexity bound analysis (invited talk). (English) Zbl 1242.68121
Bouajjani, Ahmed (ed.) et al., Computer aided verification. 21st international conference, CAV 2009, Grenoble, France, June 26–July 2, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02657-7/pbk). Lecture Notes in Computer Science 5643, 51-62 (2009).
Summary: The SPEED project addresses the problem of computing symbolic computational complexity bounds of procedures in terms of their inputs. We discuss some of the challenges that arise and present various orthogonal/complementary techniques recently developed in the SPEED project for addressing these challenges.
For the entire collection see [Zbl 1165.68004].

MSC:
68Q25 Analysis of algorithms and problem complexity
68N30 Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
PDF BibTeX XML Cite
Full Text: DOI