Efficient type-checking for amortised heap-space analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5771 LNCS, Issue , 2009, Pages 317-331

  Hofmann, Martin ^a   Rodriguez, Dulma ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

OOP; Resource analysis; Semantics; Type systems

Indexed keywords

COMPLEXITY ANALYSIS; OOP; RESOURCE ANALYSIS; RESOURCE CONSUMPTION; SAFETY CRITICAL SYSTEMS; SOUNDNESS AND COMPLETENESS; SPACE ANALYSIS; SUBTYPINGS; TYPE SYSTEMS; TYPECHECKING;

COMPUTER SCIENCE; CRYSTAL LATTICES; EMBEDDED SYSTEMS; SEMANTICS;

JAVA PROGRAMMING LANGUAGE;

EID: 70350376912     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04027-6_24     Document Type: Conference Paper

References (19)

1. [AAG+07] Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: COSTA: Design and implementation of a cost and termination analyzer for java bytecode. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2007. LNCS, vol. 5382, pp. 113-132. Springer, Heidelberg (2008)
2. [Cam08] Campbell, B.: Type-based amortized stack memory prediction. PhD thesis, University of Edinburgh (2008)
3. [DTW07] Degen, M., Thiemann, P., Wehr, S.: Tracking linear and affine resources with java(X). In: Ernst, E. (ed.) ECOOP 2007. LNCS, vol. 4609, pp. 550-574. Springer, Heidelberg (2007)
4. [FKF98] Flatt, M., Krishnamurthi, S., Felleisen, M.: Classes and mixins. In: The25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 1998), New York, January 1998, pp. 171-183. Association for Computing Machinery (1998)
5. [GL98] Gómez, G., Liu, Y.A.: Automatic accurate time-bound analysis for highlevel languages. In: Müller, F., Bestavros, A. (eds.) LCTES 1998. LNCS, vol. 1474, p. 31. Springer, Heidelberg (1998)
6. [GMC09] Gulwani, S., Mehra, K.K., Chilimbi, T.M.: SPEED: precise and efficient static estimation of program computational complexity. In: Shao, Z., Pierce, B.C. (eds.) POPL, pp. 127-139. ACM Press, New York (2009)
7. [Gro01] Grobauer, B.: Topics in Semantics-based Program Manipulation. PhD thesis, BRICS Aarhus (2001)
8. [HBH+07] Herrmann, C.A., Bonenfant, A., Hammond, K., Jost, S., Loidl, H.-W., Pointon, R.: Automatic amortised worst-case execution time analysis. In: 7th Int'l Workshop on Worst-Case Execution Time (WCET) Analysis,Proceedings, pp. 13-18 (2007)
9. [HDF+05] Hammond, K., Dyckhoff, R., Ferdinand, C., Heckmann, R., Hofmann, M., Jost, S., Loidl, H.-W., Michaelson, G., Pointon, R.F., Scaife, N., Srot, J., Wallace, A.: The embounded project (project start paper). In: van Eekelen, M.C.J.D. (ed.) Trends in Functional Programming. Trends in Functional Programming, vol. 6, pp. 195-210. Intellect (2005)
10. [HJ03] Hofmann, M., Jost, S.: Static prediction of heap space usage for first-order functional programs. In: POPL: 30th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (2003)
11. [HJ06] Hofmann, M.O., Jost, S.: Type-based amortised heap-space analysis. In: Sestoft, P. (ed.) ESOP 2006. LNCS, vol. 3924, pp. 22-37. Springer, Heidelberg (2006)
12. [HJR] Hofmann, M., Jost, S., Rodriguez, D.: Type-based amortised heap space analysis (complete soundness proof), http://raja.tcs.ifi.lmu.de/download/ files/rajaSoundProof.pdf
13. [HP99] Hughes, J., Pareto, L.: Recursion and dynamic data-structures in bounded space, June 21 (1999)
14. [IPW99] Igarashi, A., Pierce, B., Wadler, P.: Featherweight Java: A minimal core calculus for Java and GJ. In: Meissner, L. (ed.) Proceedings of the 1999 ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages & Applications (OOPSLA 1999), N.Y., vol. 34(10), pp. 132-146 (1999)
15. [MP07] Marion, J.-Y., Péchoux, R.: Resource control of object-oriented programs. CoRR, abs/0706.2293, informal publication (2007)
16. [NCQR05] Nguyen, H.H., Chin, W.N., Qin, S., Rinard, M.C.: Memory usage inference for object-oriented programs (January 2005)
17. [Oka98] Okasaki, C.: Purely Functional Data Structures. Cambridge University Press, Cambridge (1998)
18. [raj] http://raja.tcs.ifi.lmu.de
19. [Tar85] Tarjan, R.E.: Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods 6(2), 306-318 (1985)