Biblio
Filters: Keyword is Memory bound [Clear All Filters]
.
2017. A Compositional Type Systems for Finding Log Memory Bounds of Transactional Programs. Proceedings of the Eighth International Symposium on Information and Communication Technology. :409–416.
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.