Type-based amortised heap-space analysis

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

Volumn 3924 LNCS, Issue , 2006, Pages 22-37

  Hofmann, Martin ^a   Jost, Steffen ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPILE-TIME ANALYSIS; DEALLOCATION; HEAP-SPACE ANALYSIS; TYPE INFERENCE; COMPLEXITY ANALYSIS; EXTENDED ABSTRACTS; OBJECT-ORIENTED PROGRAM; SPACE ANALYSIS; SPACE LIMITATIONS; SPACE REQUIREMENTS; TECHNICAL LEMMAS; TYPE INFERENCES;

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; JAVA PROGRAMMING LANGUAGE; OBJECT ORIENTED PROGRAMMING; REQUIREMENTS ENGINEERING; RESOURCE ALLOCATION; COMPUTER SOFTWARE; WEBSITES;

STATE SPACE METHODS; OBJECT ORIENTED PROGRAMMING;

EID: 33745803642     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11693024_3     Document Type: Conference Paper

References (22)

1. E. D. Berger, B. G. Zorn, and K. S. McKinley. Reconsidering custom memory allocation. In Proceedings of the Conference on Object-Oriented Programming: Systems, Languages, and Applications (OOPSLA), 2002.
2. M. Bozga, R. Iosif, and Y. Laknech. Storeless semantics and alias logic. In Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation (PEPM), pages 55-65. ACM, 2003.
3. W.-N. Chin, H. H. Nguyen, S. Qin, and M. Rinard. Memory usage verification for oo programs. In The 12th International Static Analysis Symposium (SAS). LNCS, Sep 2005.
4. A. Deutsch. Interprocedural may-alias analysis for pointers: beyond k-limiting. ACM SIGPLAN Notices, 29(6):230-241, 1994.
5. M. Flatt, S. Krishnamurthi, and M. Felleisen. Classes and mixins. In Proceedings of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 171-183, 1998.
6. st Asian Symposium on Programming Languages and Systems (APLAS), volume 2895 of Lecture Notes in Computer Science, pages 195-211, Beijing, China, Nov. 27-29, 2003. Springer-Verlag.
7. G. Gómez and Y. A. Liu. Automatic time-bound analysis for a higher-order language. In Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation, pages 75-86. ACM Press, 2002.
8. B. Grobauer. Topics in Semantics-based Program Manipulation. PhD thesis, BRICS Aarhus, 2001.
9. M. Hofmann and S. Jost. Static prediction of heap space usage for first-order functional programs. In Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 185-197. ACM, 2003.
10. J. Hughes and L. Pareto. Recursion and dynamic data structures in bounded space: towards embedded ML programming. In Proc. International Conference on Functional Programming (ICFP). Paris, September 1999., pages 70-81, 1999.
11. A. Igarashi, B. Pierce, and P. Wadler. Featherweight Java: A minimal core calculus for Java and GJ. In L. Meissner, editor, Proceedings of the 1999 ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages & Applications (OOPSLA), volume 34(10), pages 132-146, N.Y., 1999.
12. S. S. Ishtiaq and P. W. O'Hearn. BI as an assertion language for mutable data structures. In Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 14-26. ACM, 2001.
13. H. Jonkers. Abstract storage structures. In J. W. de Bakker and J. C. van Vliet, editors, Algorithmic Languages, pages 321-343. IFIP, North Holland, 1981.
14. J. Krone, W. F. Ogden, and M. Sitaraman. Modular verification of performance constraints. Technical report, Dep. of Comp. Sci., Clemson Univeristy, May 2003.
15. N. Rinetzky, J. Bauer, T. Reps, M. Sagiv, and R. Wilhelm. A semantics for procedure local heaps and its abstractions. In Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 296-309, New York, NY, USA, 2005. ACM Press.
16. J.-P. Talpin and P. Jouvelot. Polymorphic type, region and effect inference. J. Funct. Program., 2(3):245-271, 1992.
17. R. E. Tarjan. Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods, 6(2):306-318, 1985.
18. M. Tofte, L. Birkedal, M. Elsman, N. Hallenberg, T. Olesen, and P. Sestoft. Programming with regions in the ml kit, April 2002. IT University of Copenhagen http://www.itu.dk/research/mlkit/.
19. M. Tofte and J.-P. Talpin. Region-based memory management. Information and Computation, 132(2):109-176, 1997.
20. L. Unnikrishnan, S. D. Stoller, and Y. A. Liu. Automatic accurate live memory analysis for garbage-collected languages. In Proceedings of The Workshop on Languages, Compilers, and Tools for Embedded Systems (LCTES). ACM, 2001.
21. P. Vasconcelos. Space Cost Modeling for Concurrent Resource Sensitive Systems. PhD thesis, School of Comp. Sci., University of St Andrews, Scotland, to appear.
22. D. Walker and G. Morrisett. Alias types for recursive data structures. Lecture Notes in Computer Science, 2071:177+, 2001.