Finding Resource Bounds in the Presence of Explicit Deallocation

Abstract

Abstract. A software program requesting a resource that is not available usually raises an out-of-resource exception. Component software is software that has been assembled from standardized, reusable components which, in turn, may also composed from other components. Due to the independent development and reuse of components, component software has a high risk of causing out-of-resource exceptions. We present a small component language and develop a type system which can statically prevent this type of errors . This work continues our previous works [3,18] by including explicit deallocation. We prove that the type system is sound with respect to safe deallocation and that sharp resource bounds can be computed statically.

A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets

“…Since these techniques are performed at sourcelevel, it is difficult to apply them to Java Card environment where source code is not available. Truong and Bezem [15] also give a type system for an abstract language. The type system can find a sharp upper bound of the number of instances but their type inference algorithm is polynomial.…”