Multivariate amortized resource analysis

ACM Transactions on Programming Languages and Systems

Volumn 34, Issue 3, 2012, Pages

  Hoffmann, Jan ^a   Aehlig, Klaus ^b   Hofmann, Martin ^b  

^a YALE UNIVERSITY   (United States)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

Amortized analysis; Functional programming; Quantitative analysis; Resource consumption; Static analysis

Indexed keywords

AMORTIZED ANALYSIS; AUTOMATIC ANALYSIS; FIRST-ORDER FUNCTIONAL LANGUAGES; LONGEST COMMON SUBSEQUENCES; MULTIVARIATE POLYNOMIAL; RESOURCE BOUNDS; RESOURCE CONSUMPTION; RESOURCE USAGE; SUPERLINEAR; TYPE INFERENCES; TYPE SYSTEMS; UNARY FUNCTIONS;

CHEMICAL ANALYSIS; DEPRECIATION; FORESTRY; STATIC ANALYSIS;

FUNCTIONAL PROGRAMMING;

CHEMICAL ANALYSIS; COMPUTER PROGRAMING; FORESTRY; QUANTITATIVE ANALYSIS;

EID: 84869453029     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/2362389.2362393     Document Type: Article

References (57)

1. ALBERT, E., ALONSO, D., ARENAS, P., GENAIM, S., AND PUEBLA, G. 2009a. Asymptotic resource usage bounds. In Proceedings of the 7th Asian Symposium Programming Languages and Systems (APLAS'09). Springer, 294-310.
2. ALBERT, E., ARENAS, P., GENAIM, S., GÓMEZ-ZAMALLOA, M., PUEBLA, G., RAMÍREZ, D., ROMÁN, G., AND ZANARDINI, D. 2009b. Termination and cost analysis with COSTA and its user interfaces. Electr. Notes Theor. Comput. Sci. 258, 1, 109-121.
3. ALBERT, E., ARENAS, P., GENAIM, S., AND PUEBLA, G. 2008. Automatic inference of upper bounds for recurrence relations in cost analysis. In Proceedings of the 15th International Symposium on Static Analysis (SAS'08). Springer, 221-237.
4. ALBERT, E., ARENAS, P., GENAIM, S., AND PUEBLA, G. 2011a. Closed-form upper bounds in static cost analysis. J. Autom. Reason. 46, 2, 161-203.
5. ALBERT, E., ARENAS, P., GENAIM, S., PUEBLA, G., AND ZANARDINI, D. 2007. Cost analysis of java bytecode. In Proceedings of the 16th European Symposium on Programming Languages and Systems (ESOP'07). Springer, 157-172.
6. ALBERT, E., GENAIM, S., AND GÓMEZ-ZAMALLOA, M. 2010. Parametric inference of memory requirements for garbage collected languages. In Proceedings of the 9th International Symposium on Memory Management (ISMM'10). ACM, New York, 121-130.
7. ALBERT, E., GENAIM, S., AND MASUD, A. N. 2011b. More precise yet widely applicable cost analysis. In Proceedings of the 12th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'11). Springer, 38-53.
8. ALTHAUS, E., ALTMEYER, S., AND NAUJOKS, R. 2011. Precise and efficient parametric path analysis. In Proceedings of the Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES'11). ACM, New York, 141-150.
9. ALTMEYER, S., HUMBERT, C., LISPER, B., AND WILHELM, R. 2008. Parametric timing analysis for complex architectures. In Proceedings of the 4th IEEE Internationl Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'08). IEEE, 367-376.
10. ATKEY, R. 2010. Amortised resource analysis with separation logic. In Proceedings of the 19th European Symposium on Programming Languages and Systems (ESOP'10). Springer, 85-103.
11. BENZINGER, R. 2001. Automated complexity analysis of nuprl extracted programs. J. Funct. Program. 11, 1, 3-31.
12. BENZINGER, R. 2004. Automated higher-order complexity analysis. Theor. Comput. Sci. 318, 1-2, 79-103.
13. BERINGER, L., HOFMANN, M., MOMIGLIANO, A., AND SHKARAVSKA, O. 2004. Automatic certification of heap consumption. In Proceedings of the 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'04). Springer, 347-362.
14. BRABERMAN, V. A., FERNÁNDEZ, F. J., GARBERVETSKY, D., AND YOVINE, S. 2008. Parametric prediction of heap memory requirements. In Proceedings of the 7th International Symposium on Memory Management (ISMM'08). ACM, New York, 141-150.
15. BYGDE, S., ERMEDAHL, A., AND LISPER, B. 2009. An efficient algorithm for parametric WCET calculation. In Proceedings of the 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'09). IEEE, Los Alamitos, CA, 13-21.
16. CAMPBELL, B. 2009. Amortised memory analysis using the depth of data structures. In Proceedings of the 18th European Symposium on Programming Languages and Systems (ESOP'09). Springer, 190-204.
17. CHIN, W.-N. AND KHOO, S.-C. 2001. Calculating sized types. High.-Ord. Symb. Comp. 14, 2-3, 261-300.
18. CHIN, W.-N., NGUYEN, H. H., POPEEA, C., AND QIN, S. 2008. Analysing memory resource bounds for low-level programs. In Proceedings of the 7th International Symposium on Memory Management (ISMM'08). ACM, New York, 151-160.
19. CLAUSS, P., FERNÁNDEZ, F. J., GARBERVETSKY, D., AND VERDOOLAEGE, S. 2009. Symbolic polynomial maximization over convex sets and its application to memory requirement estimation. IEEE Trans. VLSI Syst. 17, 8, 983-996.
20. COOK, B., GUPTA, A., MAGILL, S., RYBALCHENKO, A., SIMSA, J., SINGH, S., AND VAFEIADIS, V. 2009. Finding heapbounds for hardware synthesis. In Proceedings of the 9th International Conference on Formal Methods in Computer-Aided Design (FMCAD'09). IEEE, Los Alamitos, CA, 205-212.
21. COUSOT, P. AND COUSOT, R. 1992. Inductive definitions, semantics and abstract interpretations. In Proceedings of the 19th ACM Symposium on Principles of Programming Languages (POPL'92). ACM, New York, 83-94.
22. CRARY, K. AND WEIRICH, S. 2000. Resource bound certification. In Proceedings of the 27th ACM Symposium on Principles of Programming Languages (POPL'00). ACM, New York, 184-198.
23. DANIELSSON, N. A. 2008. Lightweight semiformal time complexity analysis for purely functional data structures. In Proceedings of the 35th ACM Symposium on Principles of Programming Languages (POPL'08). ACM, New York, 133-144.
24. DEBRAY, S. K. AND LIN, N.-W. 1993. Cost analysis of logic programs. ACM Trans. Program. Lang. Syst. 15, 5, 826-875.
25. FLAJOLET, P., SALVY, B., AND ZIMMERMANN, P. 1991. Automatic average-case analysis of algorithms. Theoret. Comput. Sci. 79, 1, 37-109.
26. GROBAUER, B. 2001. Cost recurrences for DML programs. In Proceedings of the 6th International Conference on Functional Programming (ICFP'01). ACM, New York, 253-264.
27. GULAVANI, B. S. AND GULWANI, S. 2008. A numerical abstract domain based on expression abstraction and max operator with application in timing analysis. In Proceedings of the 20th International Conference Computer Aided Verification (CAV'08). Springer, 370-384.
28. GULWANI, S., JAIN, S., AND KOSKINEN, E. 2009a. Control-flow refinement and progress invariants for bound analysis. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI'09). ACM, New York, 375-385.
29. GULWANI, S., MEHRA, K. K., AND CHILIMBI, T. M. 2009b. SPEED: Precise and efficient static estimation of program computational complexity. In Proceedings of the 36th ACM Symposium on Principles of Programming Languages (POPL'09). ACM, New York, 127-139.
30. GULWANI, S. AND ZULEGER, F. 2010. The reachability-bound problem. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI'10). ACM, New York, 292-304.
31. HAMMOND, K. AND MICHAELSON, G. 2003. Hume: A domain-specific language for real-time embedded systems. In Proceedings of the International Conference on Generative Programming and Component Engineering (GPCE'03). Springer, 37-56.
32. HICKEY, T. J. AND COHEN, J. 1988. Automating program analysis. J. ACM 35, 1, 185-220.
33. HOFFMANN, J. 2011. Types with potential: Polynomial resource bounds via automatic amortized analysis. Ph. D. thesis, Ludwig-Maximilians-Universiät, München, Germany.
34. HOFFMANN, J., AEHLIG, K., AND HOFMANN, M. 2011. Multivariate amortized resource analysis. In Proceedings of the 38th ACM Symposium on Principles of Programming Languages (POPL'11). ACM, New York, 357-370.
35. HOFFMANN, J. AND HOFMANN, M. 2010a. Amortized resource analysis with polymorphic recursion and partial big-step operational semantics. In Proceedings of the 8th Asian Symposium on Programming Languages and Systems (APLAS'10). Springer, 172-187.
36. HOFFMANN, J. AND HOFMANN, M. 2010b. Amortized resource analysis with polynomial potential. In Proceedings of the 19th European Symposium on Programming Languages and Systems (ESOP'10). ACM, New York, 287-306.
37. HOFMANN, M. 2000. A type system for bounded space and functional in-place update-extended abstract. In Proceedings of the 9th European Symposium on Programming Languages and Systems (ESOP'00). Springer, 165-179.
38. HOFMANN, M. AND JOST, S. 2003. Static prediction of heap space usage for first-order functional programs. In Proceedings of the 30th ACM Symposium on Principles of Programming Languages (POPL'03). ACM, New York, 185-197.
39. HOFMANN, M. AND JOST, S. 2006. Type-based amortised heap-space analysis. In Proceedings of the 15th European Symposium on Programming Languages and Systems (ESOP'06). Springer, 22-37.
40. HOFMANN, M. AND RODRIGUEZ, D. 2009. Efficient type-checking for amortised heap-space analysis. In Proceedings of the 18th Conference on Computer Science Logic (CSL'09). Springer, 317-331.
41. HUGHES, J. AND PARETO, L. 1999. Recursion and dynamic data-structures in bounded space: Towards embedded ML programming. In Proceedings of the 4th International Conference on Functional Programming (ICFP'99). ACM, New York, 70-81.
42. HUGHES, J., PARETO, L., AND SABRY, A. 1996. Proving the correctness of reactive systems using sized types. In Proceedings of the 23rd ACM Symposium on Principles of Programming Languages (POPL'96). ACM, New York, 410-423.
43. JOST, S., HAMMOND, K., LOIDL, H.-W., AND HOFMANN, M. 2010. Static determination of quantitative resource usage for higher-order programs. In Proceedings of the 37th ACM Symposium on Principles of Programming Languages (POPL'10). ACM, New York, 223-236.
44. JOST, S., LOIDL, H.-W., HAMMOND, K., SCAIFE, N., AND HOFMANN, M. 2009. Carbon credits for resource-bounded computations using amortised analysis. In Proceedings of the 16th International Symposium on Formal Methods (FM'09). Springer, 354-369.
45. LEROY, X. 2006. Coinductive big-step operational semantics. In Proceedings of the 15th European Symposium on Programming Languages and Systems (ESOP'06). Springer, 54-68.
46. LISPER, B. 2003. Fully automatic, parametric worst-case execution time analysis. In Proceedings of the 3rd International Workshop on Worst-Case Execution Time Analysis (WCET'03). 99-102.
47. MÉTAYER, D. L. 1988. ACE: An automatic complexity evaluator. ACM Trans. Program. Lang. Syst. 10, 2, 248-266.
48. PIERCE, B. C. 2004. Advanced Topics in Types and Programming Languages. The MIT Press, Cambridge, MA.
49. RAMSHAW, L. H. 1979. Formalizing the analysis of algorithms. Ph. D. thesis, Stanford University, Stanford, CA, USA.
50. ROSENDAHL, M. 1989. Automatic complexity analysis. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture (FPCA'89). ACM, New York, 144-156.
51. SHKARAVSKA, O., VAN KESTEREN, R., AND VAN EEKELEN, M. C. 2007. Polynomial size analysis of first-order functions. In Proceedings of the 7th International Conference on Typed Lambda Calculi and Applications (TLCA'07). Springer, 351-365.
52. STANLEY, R. P. 2001. Enumerative Combinatorics Vol. 2. Cambridge University Press, New York, USA.
53. TAHA, W., ELLNER, S., AND XI, H. 2003. Generating heap-bounded programs in a functional setting. In Proceedings of the 3rd International Conference on Embedded Software (EMSOFT'03). Springer, 340-355.
54. TARJAN, R. E. 1985. Amortized computational complexity. SIAM J. Algebr. Discr. Methods 6, 2, 306-318.
55. VASCONCELOS, P. 2008. Space cost analysis using sized types. Ph. D. thesis, School of Computer Science, University of St Andrews, St Andrews, UK.
56. WEGBREIT, B. 1975. Mechanical program analysis. Commun. ACM 18, 9, 528-539.
57. WILHELM, R., ENGBLOM, J., ERMEDAHL, A., HOLSTI, N., THESING, S., WHALLEY, D. B., BERNAT, G., FERDINAND, C., HECKMANN, R., MITRA, T., MUELLER, F., PUAUT, I., PUSCHNER, P. P., STASCHULAT, J., AND STENSTRÖM, P. 2008. The worst-case execution-time problem - Overview of methods and survey of tools. ACM Trans. Embedded Comput. Syst. 7, 3, 36:1-36:53.