Static determination of quantitative resource usage for higher-order programs

ACM SIGPLAN Notices

Volumn 45, Issue 1, 2010, Pages 223-236

  Jost, Steffen ^a   Hammond, Kevin ^a   Loidl, Hans Wolfgang ^b   Hofmann, Martin ^b  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

Functional Programming; Resource Analysis; Types

Indexed keywords

FUNCTIONAL PROGRAMMING; SAFETY ENGINEERING; STATIC ANALYSIS;

AUTOMATIC STATIC ANALYSIS; AUTOMOTIVE APPLICATIONS; DYNAMIC MEMORY ALLOCATION; HIGHER ORDER FUNCTIONS; HIGHER-ORDER PROGRAMS; RESOURCE ANALYSIS; TYPES; WORST-CASE EXECUTION TIME;

COST BENEFIT ANALYSIS;

EID: 77149143883     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1707801.1706327     Document Type: Conference Paper

References (40)

1. A. Abel. A Polymorphic Lambda-Calculus with Sized Higher-Order Types. PhD thesis, Ludwig-Maximilians-Universität München, 2006.
2. E. Albert, S. Genaim, and M. Ǵomez-Zamalloa. Live Heap Space Analysis for Languages with Garbage Collection. In Proc. ISMM 2009: Intl. Symp. on Memory Management, pages 129-138, Dublin, Ireland, June 2009. ACM.
3. R. Benzinger. Automated Complexity Analysis of Nuprl Extracted Programs. Journal of Functional Programming, 11(1):3-31, 2001. (Pubitemid 33684412)
4. M. Berkelaar, K. Eikland, and P. Notebaert. lp solve: Open Source (Mixed-Integer) Linear Programming System. Published under GNU LGPL (Lesser General Public Licence). http://lpsolve.sourceforge.net/5.5.
5. B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Mińe, D. Monniaux, and X. Rival. A Static Analyzer for Large Safety Critical Software. In Proc. PLDI'03: Conf. on Programming Language Design and Implementation, pages 196-207, San Diego, USA, June 2003. ACM.
6. B. Campbell. Amortised Memory Analysis Using the Depth of Data Structures. In Proc. ESOP 2009: European Symposium on Programming, LNCS 5502, pages 190-204, York, UK, 2009. Springer.
7. W.-N. Chin and S.-C. Khoo. Calculating Sized Types. Higher-Order and Symbolic Computing, 14(2,3):261-300, 2001.
8. W.-N. Chin, H. Nguyen, C. Popeea, and S. Qin. Analysing Memory Resource Bounds for Low-Level Programs. In Proc. ISMM'08: Intl. Symp. on Memory Management, pages 151-160, Tucson, USA, June 2008. ACM.
9. K. Crary and S. Weirich. Resource Bound Certification. In Proc. POPL'00: Symp. on Princ. of Prog. Langs, pages 184-198, Boston, USA, 2000. ACM.
10. N. Danielsson. Lightweight Semiformal Time Complexity Analysis for Purely Functional Data Structures. In Proc. POPL'08: Symp. on Princ. of Prog. Langs, pages 133-144, San Francisco, USA, 2008.
11. C. Ferdinand, R. Heckmann, M. Langenbach, F. Martin, M. Schmidt, H. Theiling, S. Thesing, and R.Wilhelm. Reliable and Precise WCET Determination for a Real-Life Processor. In Proc EMSOFT'01: Intl Workshop on Embedded Software, LNCS 2211, pages 469-485, Tahoe City, USA, Oct. 2001. Springer.
12. G. Gomez and Y. Liu. Automatic Time-Bound Analysis for a HigherOrder Language. In Proc. LCTES'98: Conf. on Languages, Compilers and Tools for Embedded Systems, LNCS 1474, pages 31-40,Montreal, Canada, June 1998. Springer.
13. Estimation of Program Computational Complexity. In Proc. POPL'09: Symp. on Princ. of Prog. Langs, pages 127-139, Savannah, USA, Jan. 2009. ACM.
14. K. Hammond and G. Michaelson. Hume: a Domain-Specific Language for Real-Time Embedded Systems. In Proc. GPCE 2003: Intl. Conf. on Generative Prog. and Component Eng., LNCS 2830, pages 37-56, Erfurt, Germany, Sept. 2003. Springer.
15. F. Henglein. Type Inference with Polymorphic Recursion. ACM TOPLAS: Trans. Prog. Langs. Systs, 15(2):253-289, April 1993.
16. J. Hoffmann and M. Hofmann. Amortized Resource Analysis with Polynomial Potential. In preparation.
17. M. Hofmann. A Type System for Bounded Space and Functional In-Place Update. Nordic Journal of Computing, 7(4):258-289, 2000.
18. M. Hofmann. The Strength of non Size-Increasing Computation. In Proc. POPL'02: Symp. on Princ. of Prog. Langs, pages 260-269, Portland, USA, Jan. 2002. ACM.
19. M. Hofmann and S. Jost. Static Prediction of Heap Space Usage for First-Order Functional Programs. In Proc. POPL '03: Symp. on Princ. of Prog. Langs, pages 185-197, New Orleans, USA, Jan. 2003. ACM.
20. L. Huelsbergen, J. Larus, and A. Aiken. Using the Run-Time Sizes of Data Structures to Guide Parallel Thread Creation. In Proc. LFP'94: Symp. on Lisp and Functional Programming, pages 79-90, Orlando, USA, June 1994. ACM.
21. R. Hughes and L. Pareto. Recursion and Dynamic Data Structures in Bounded Space: Towards Embedded ML Programming. In Proc. ICFP '99: Intl. Conf. on Functional Programming, pages 70-81, Paris, France, Sept. 1999. ACM.
22. R. Hughes, L. Pareto, and A. Sabry. Proving the Correctness of Reactive Systems Using Sized Types. In Proc. POPL'96: Symp. on Princ. of Prog. Langs, pages 410-423, St. Petersburg Beach, USA, Jan. 1996. ACM.
23. S. Ishtiaq and P. O'Hearn. BI as an Assertion Language for Mutable Data Structures. In Proc. POPL'01: Symp. on Princ. of Prog. Langs., pages 14-26. ACM, Jan. 2001.
24. H. Jonkers. Abstract Storage Structures. In Algorithmic Languages, pages 321-343. IFIP, North Holland, 1981.
25. S. Jost, H.-W. Loidl, K. Hammond, N. Scaife, and M. Hofmann. "Carbon Credits" for Resource-Bounded Computations using Amortised Analysis. In Proc. FM '09: Intl. Symp. on Formal Methods, LNCS 5850, Eindhoven, the Netherlands, Nov. 2009. Springer.
26. A. J. Kfoury, J. Tiuryn, and P. Urzyczyn. Type Reconstruction in the Presence of Polymorphic Recursion. ACM TOPLAS: Trans. Prog. Langs. Systs, 15(2):290-311, April 1993.
27. J. Launchbury. A Natural Semantics for Lazy Evaluation. In Proc. POPL'93: Symp. on Princ. of Prog. Langs., pages 144-154, Charleston, USA, Jan. 1993. ACM.
28. D. Le Ḿetayer. ACE: An Automatic Complexity Evaluator. ACM TOPLAS: Trans. on Prog. Langs. and Systs, 10(2), April 1988.
29. B. Lisper. Fully Automatic, Parametric Worst-Case Execution Time Analysis. In Proc. WCET '03: Intl. Workshop on Worst-Case Execution Time Analysis, pages 99-102, 2003.
30. H.-W. Loidl and S. Jost. Improvements to a Resource Analysis for Hume. In Proc. FOPARA '09: Intl. Workshop on Foundational and Practical Aspects of Resource Analysis, Nov. 2009. Submitted.
31. C. Okasaki. Purely Functional Data Structures. Cambridge University Press, 1998. ISBN 0521663504.
32. R. Pena, C. Segura, and M. Montenegro. A Sharing Analysis for Safe. In Proc TFP'06: Symp. on Trends in Functional Programming, pages 109-128, Nottingham, UK, Apr. 2006. Intellect.
33. J. C. Reynolds. Definitional Interpreters for Higher-Order Programming Languages. In Proc of the 25th ACMNational Conference, pages 717-740. ACM, 1972.
34. N. Rinetzky, J. Bauer, T. Reps,M. Sagiv, and R.Wilhelm. A Semantics for Procedure Local Heaps and its Abstractions. In Proc. POPL'05: Symp. on Princ. of Prog. Langs, pages 296-309. ACM, Jan. 2005.
35. O. Shkaravska, R. van Kesteren, and M. van Eekelen. Polynomial Size Analysis of First-Order Functions. In Proc. TLCA 2007: Intl. Conf. on Typed Lambda Calculi and Applications, LNCS 4583, pages 351-365, Paris, France, June 2007. Springer.
36. W. Taha, S. Ellner, and H. Xi. Generating Heap-Bounded Programs in a Functional Setting. In Proc. EMSOFT '03: Intl. Conf. on Embedded Software, LNCS 2855, pages 340-355. Springer, 2003.
37. R. E. Tarjan. Amortized Computational Complexity. SIAM Journal on Algebraic and Discrete Methods, 6(2):306-318, April 1985.
38. P. Vasconcelos. Cost Inference and Analysis for Recursive Functional Programs. PhD thesis, University of St Andrews, Feb. 2008.
39. P. Vasconcelos and K. Hammond. Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs. In Proc. IFL 2003: Intl. Workshop on Impl. of Functional Languages, LNCS 3145, pages 86-101, Edinburgh, UK, Sept. 2003. Springer.
40. D. Walker and G. Morrisett. Alias Types for Recursive Data Structures. In Proc. TIL'00: Types in Compilation, LNCS 2071, pages 177- 206. Springer, 2000.