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

Authors:
Xuan-Tung Vu;Mai Thuong Tran;Anh-Hoang Truong;Martin Steffen
Affiliations:
University of Engineering and Technology, VNU Hanoi;University of Oslo, Norway;University of Engineering and Technology, VNU Hanoi;University of Oslo, Norway
Venue:
Proceedings of the Third Symposium on Information and Communication Technology
Year:
2012

Citing 9
Cited 0

Software transactional memory

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Region-based memory management

Information and Computation
Recursion and dynamic data-structures in bounded space: towards embedded ML programming

Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Static prediction of heap space usage for first-order functional programs

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A transactional object calculus

Science of Computer Programming
Heap space analysis for java bytecode

Proceedings of the 6th international symposium on Memory management
A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets

SEFM '08 Proceedings of the 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods
Symbolic and analytic techniques for resource analysis of java bytecode

TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Memory usage verification for OO programs

SAS'05 Proceedings of the 12th international conference on Static Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a static, compositional analysis based on a type and effect system to estimate an upper bound for the resource consumption of nested and multi-threaded transactional programs. This work extends our previous type system for Transactional Featherweight Java to allow more liberal use of transactions in the semantics. The new types are also more expressive and structurally simpler using a linear representation instead of a tree representation for capturing static approximation of resource consumption. We prove the soundness of our analysis.