Journal of the ACM (JACM)
ACE: an automatic complexity evaluator
ACM Transactions on Programming Languages and Systems (TOPLAS)
Cost analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
REDLOG: computer algebra meets computer logic
ACM SIGSAM Bulletin
Communications of the ACM
Inferring Argument Size Relationships with CLP(R)
LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
SPEED: precise and efficient static estimation of program computational complexity
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
Discovering non-linear ranking functions by solving semi-algebraic systems
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
The reachability-bound problem
PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
Parametric inference of memory requirements for garbage collected languages
Proceedings of the 2010 international symposium on Memory management
Multivariate amortized resource analysis
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Closed-Form Upper Bounds in Static Cost Analysis
Journal of Automated Reasoning
More precise yet widely applicable cost analysis
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Verification and synthesis using real quantifier elimination
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Bound analysis of imperative programs with the size-change abstraction
SAS'11 Proceedings of the 18th international conference on Static analysis
Cost analysis of object-oriented bytecode programs
Theoretical Computer Science
Calculating polynomial runtime properties
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Efficient preprocessing methods for quantifier elimination
CASC'06 Proceedings of the 9th international conference on Computer Algebra in Scientific Computing
On the Inference of Resource Usage Upper and Lower Bounds
ACM Transactions on Computational Logic (TOCL)
Path-sensitive resource analysis compliant with assertions
Proceedings of the Eleventh ACM International Conference on Embedded Software
| Hi-index | 0.00 |
The classical approach to static cost analysis is based on transforming a given program into cost relations and solving them into closed-form upper-bounds. It is known that for some programs, this approach infers upper-bounds that are asymptotically less precise than the actual cost. As yet, it was assumed that this imprecision is due to the way cost relations are solved into upper-bounds. In this paper: (1) we show that this assumption is partially true, and identify the reason due to which cost relations cannot precisely model the cost of such programs; and (2) to overcome this imprecision, we develop a new approach to cost analysis, based on SMT and quantifier elimination. Interestingly, we find a strong relation between our approach and amortised cost analysis.