Static techniques for reducing memory usage in the C implementation of Whiley programs
Loading...
Files
Permanent Link
Publisher link
Rights
© ACM, 2017. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of Australasian Computer Science Week Multiconference, ACSW '17, http://dl.acm.org/citation.cfm?doid=3014812.3014827.
Abstract
Languages that use call-by-value semantics, such as Whiley, can make program verification easier. But effcient implementation becomes harder, due to the overhead of copying and garbage collection. This paper describes how a mixture of static analysis and runtime-monitoring can be used to eliminate unnecessary copying and deallocate memory with- out garbage collection. We show that this allows Whiley programs to be translated into effcient C implementations.
Citation
Weng, M.-H., Pfahringer, B., & Utting, M. (2017). Static techniques for reducing memory usage in the C implementation of Whiley programs. In Proceedings of Australasian Computer Science Week Multiconference, ACSW ’17, January 30-February 03, 2017, Article No. 15. New York, USA: ACM. https://doi.org/10.1145/3014812.3014827
Series name
Date
Publisher
ACM