SPEED: Symbolic Complexity Bound Analysis
No abstract available.
Related papers
- SPEED: precise and efficient static estimation of program computational complexity POPL 2009
- Speeding up symbolic reasoning for relational queries OOPSLA 2018
- Control-flow refinement and progress invariants for bound analysis PLDI 2009
- A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis CAV 2014
- Scaling symbolic execution using ranged analysis OOPSLA 2012
- Symbolic Model Checking without BDDs TACAS 1999
- Parallel and distributed bounded model checking of multi-threaded programs PPoPP 2020
- Automated complexity analysis of Nuprl extracted programs Journal of Functional Programming JFP 2001