Luo, C. and He, G. and Qin, S. (2008) 'A heap model for Java bytecode to support separation logic.', in 15th Asia-Pacific Software Engineering Conference, 2-5 December 2008, Beijing, China ; proceedings. Los Alamitos, CA: IEEE, pp. 127-134.
Memory usage analysis is an important problem for resource-constrained mobile devices, especially under mission- or safety-critical circumstances. Program codes running on or being downloaded into such devices are often available in low-level bytecode forms. We propose in this paper a formal heap model for Java bytecode language, on top of which we can then provide separation logic support for further memory usage verification. Our low-level heap model for Java bytecode would allow us to reason about the size and alignment properties of primitive values stored in the heap. To support type-related reasoning such as guaranteeing type and alignment safety, this model is also lifted with both base types and user-defined classes. Based on such model, we have also defined a separation logic proof system whose assertions are interpreted using the lifted heap with types. We envision, with further extension, the system would provide good support for memory usage analysis and verification for mobile devices.
|Item Type:||Book chapter|
|Full text:||(VoR) Version of Record|
Download PDF (152Kb)
|Publisher Web site:||http://dx.doi.org/10.1109/APSEC.2008.72|
|Publisher statement:||© 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Record Created:||23 Nov 2009 12:05|
|Last Modified:||08 Nov 2010 12:01|
|Social bookmarking:||Export: EndNote, Zotero | BibTex|
|Look up in GoogleScholar | Find in a UK Library|