SPEED: Symbolic Complexity Bound Analysis

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.

• Type: Conference
• Year: 2009
• Where: CAV
• Authors: Sumit Gulwani
• Keywords: CAV 2009, Computational Complexity Bounds, Formal Methods