A Compositional Type Systems for Finding Log Memory Bounds of Transactional Programs

Ngoc-Khai Nguyen,Anh-Hoang Truong

doi:10.1145/3155133.3155183

A Compositional Type Systems for Finding Log Memory Bounds of Transactional Programs

Ngoc-Khai Nguyen, Anh-Hoang Truong

https://doi.org/10.1145/3155133.3155183

Copy DOI

Publication Date: Dec 7, 2017

Citations: 1

Affiliation: Hanoi University of Natural Resources and Environment, VNU University of Science

#Type Systems #Previous Works + Show 7 more

Abstract
Full-Text PDF
Similar Papers

Abstract

In our previous works, we proposed several type systems that can guarantee log memory bounds of transactional programs. One drawback of these type systems is their restricted compositionality. In this work, we develop a type system that is completely compositional. It allows us to type any sub-terms of the program, instead of bottom-up style in our previous works. In addition, we also extend the language with basic elements that are close to real world languages instead of abstract languages as in our previous works. This increases the implementability of our type systems to real world languages.

Full Text