A type system for finding upper resource bounds of multi-threaded programs with nested transactions

Software transactional memory (STM) programs usually use more memory resources than traditional programs. Therefore, estimating an upper bound of memory resources used by an STM program is crucial for optimizing the program and reducing the risks of out-of-memory runtime exceptions. However, due to the complex nesting of transactions and threads, the estimation problem is challenging. In our previous work, we have developed several type systems to address the problem for core imperative languages with STM primitives. This work advances our previous works, in which we add object-oriented constructs to the language while keeping the STM primitives, to make the language closer to practical languages. Then, we built a type system to statically estimate the maximum memory required by well-typed programs of the language.

show abstract

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

Nguyen

Truong

2017

Proceedings of the Eighth International Symposium on Information and Communication Technology

View full text Add to dashboard Cite

A type system for finding upper resource bounds of multi-threaded programs with nested transactions

Cited by 3 publications

References 12 publications

A Type System for Counting Logs of Multi-threaded Nested Transactional Programs

A Type System for Counting Logs of Multi-threaded Nested Transactional Programs

Finding Memory Bound of Cloned Objects in Software Transactional Memory Programs

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

Contact Info

Product

Resources

About