Proving Memory Management Invariants for a Language Based on Linear Logic (1992)
| Venue: | In LISP and Functional Programming |
| Citations: | 22 - 2 self |
BibTeX
@INPROCEEDINGS{Chirimar92provingmemory,
author = {Jawahar Chirimar and Carl A. Gunter and Jon G. Riecke},
title = {Proving Memory Management Invariants for a Language Based on Linear Logic},
booktitle = {In LISP and Functional Programming},
year = {1992},
pages = {139--150},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
: We develop tools for the rigorous formulation and proof of properties of runtime memory management for a sample programming language based on a linear type system. Two semantics are described, one at a level of observable results of computations and one describing linear connectives in terms of memory-management primitives. The two semantics are proven equivalent and the memory-management model is proven to satisfy fundamental correctness criteria for reference counts. 1 Introduction Although much literature on optimization of programs discusses the interaction of program execution and memory management, one does not often find formal statements and proofs regarding this interaction. For instance, a compiler for a functional language may generate code that updates an array in-place instead of copying the entire array, even though this optimization is not always safe. The compiler writer probably does not prove the optimization is safe: the size and complexity of real compilers is on...
