SPEED: precise and efficient static estimation of program computational complexity

By Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilimbi. ACM-SIGACT Symposium on Principles of Programming Languages, 2009

364 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Software

View Paper: https://www.semanticscholar.org/paper/5a6682af0ad2eb0e08e6f52c0101119c603b663c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Aditya Akella
2. Shan Lu
3. Srikanth Kandula
4. Ganesh Ananthanarayanan

In Computational Theory and Mathematics

1. Shan Lu

In Software

1. Shan Lu

Citations in the corpus

• Multi-resource packing for cluster schedulers (2014, background): “Finally, there has been recent work on static program analysis to estimate resource demands [14].”
• Understanding and detecting real-world performance bugs (2012, background): “Recent work that automatically calculates function complexity is also promising [18].”