Affiliation:
1. Xerox Palo Alto Research Center, Palo Alto, CA
Abstract
One means of analyzing program performance is by deriving closed-form expressions for their execution behavior. This paper discusses the mechanization of such analysis, and describes a system, Metric, which is able to analyze simple Lisp programs and produce, for example, closed-form expressions for their running time expressed in terms of size of input. This paper presents the reasons for mechanizing program analysis, describes the operation of Metric, explains its implementation, and discusses its limitations.
Publisher
Association for Computing Machinery (ACM)
Cited by
179 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Robust Resource Bounds with Static Analysis and Bayesian Inference;Proceedings of the ACM on Programming Languages;2024-06-20
2. Solving Recurrence Relations using Machine Learning, with Application to Cost Analysis;Electronic Proceedings in Theoretical Computer Science;2023-09-12
3. Runtime Complexity Bounds Using Squeezers;ACM Transactions on Programming Languages and Systems;2022-07-15
4. Model Checking-Based Performance Prediction for P4;Electronics;2022-07-06
5. Modeling Asymptotic Complexity Using ACL2;Electronic Proceedings in Theoretical Computer Science;2022-05-24