Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

CAV
2009
Springer

favoriteEmaildiscussreport

104views Hardware» more CAV 2009»

SPEED: Symbolic Complexity Bound Analysis

14 years 4 months ago

SPEED: Symbolic Complexity Bound Analysis

Download research.microsoft.com

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.

Sumit Gulwani

Real-time Traffic

CAV 2009 | Computational Complexity Bounds | Formal Methods |

claim paper

Related Content

» SPEED precise and efficient static estimation of program computational complexity

» Optimal Pilot Symbol Distribution for Efficient and LowComplexity DopplerShift and Doppler...

» Quasiorthogonal STBC with minimum decoding complexity performance analysis optimal signal ...

» Performance Analysis and Optimal Signal Designs for Minimum Decoding Complexity ABBA Codes

» Symbolic performance analysis of elastic systems

» Brief announcement collaborative measurement of upload speeds in P2P systems

» Universally Composable Symbolic Security Analysis

» Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reach...

» Joint data QRdetection and Kalman estimation for OFDM timevarying Rayleigh channel complex...

Post Info
More Details (n/a)

Added	25 Nov 2009
Updated	25 Nov 2009
Type	Conference
Year	2009
Where	CAV
Authors	Sumit Gulwani

Comments (0)