We present a type-based approach to statically derive symbolic closed-form formulae that characterize the bounds of heap memory usages of programs written in object-oriented languages. Given a program with size and alias annotations, our inference system will compute the amount of memory required by the methods to execute successfully as well as the amount of memory released when methods return. The obtained analysis results are useful for networked devices with limited computational resources as well as embedded software. / Singapore-MIT Alliance (SMA)
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/7428 |
| Date | 01 1900 |
| Creators | Nguyen, Huu Hai, Chin, Wei Ngan, Qin, Shengchao, Rinard, Martin C. |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | English |
| Detected Language | English |
| Type | Article |
| Format | 164810 bytes, application/pdf |
| Relation | Computer Science (CS); |
Page generated in 0.0028 seconds