Memory Usage Verification for OO Programs

Chin, Wei-Ngan; Nguyen, Huu Hai; Qin, Shengchao; Rinard, Martin

doi:10.1007/11547662_7

Cited by 45 publications

(55 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In a series of papers [2,13,19] Chin and his collaborators have used sized types and separation logic for the generation of symbolic resource bounds for objectoriented programs. Presently, the method is not fully automatic because the user must provide aliasing and shape information.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

“…The need for resource prediction has been widely recognised [1][2][3] and is also intuitively plausible. Just think of software running on small, resourceconstrained devices such as smart cards, microcontrollers, phones, or software running on large servers shared between many users as in cloud computing.…”

Section: Introductionmentioning

confidence: 99%

“…Approaches based on recurrence solving [1,4,5] or on abstract interpretation [6,2,3] have matured to a point where programs of several hundred lines of code can be automatically analysed. These techniques work under the assumption that control-flow is either fixed or determined by some easily obtainable numeric parameters such as length or size of input or linear arithmetic functions thereof.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Automatic Type Inference for Amortised Heap-Space Analysis

Hofmann

Rodriguez²

2013

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. We present a fully automatic, sound and modular heap-space analysis for object-oriented programs. In particular, we provide type inference for the system of refinement types RAJA, which checks upper bounds of heap-space usage based on amortised analysis. Until now, the refined RAJA types had to be manually specified. Our type inference increases the usability of the system, as no user-defined annotations are required.The type inference consists of constraint generation and solving. First, we present a system for generating subtyping and arithmetic constraints based on the RAJA typing rules. Second, we reduce the subtyping constraints to inequalities over infinite trees, which can be solved using an algorithm that we have described in previous work. This paper also enriches the original type system by introducing polymorphic method types, enabling a modular analysis.

show abstract

Section: Conclusion and Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Automatic Type Inference for Amortised Heap-Space Analysis

Hofmann

Rodriguez²

2013

Programming Languages and Systems

View full text Add to dashboard Cite

show abstract

“…Like Pareto's checker, the system is based on solving systems of Presburger formulae. Their later work considers properties about the values in containers [14], a language with references [15], space bounds for object-oriented languages [16], and applying similar techniques to assembly programs [17]. Vasconcelos has also studied these inference systems in order to produce a sized types analysis and heap and stack space bounds for Hume [18].…”

Section: Related Workmentioning

confidence: 99%

Amortised Memory Analysis Using the Depth of Data Structures

Campbell

2009

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amounts of free space (called potential) to data structures in proportion to their sizes using type annotations. Constraints on these annotations in the type system ensure that the total potential assigned to the input is an upper bound on the total memory required to satisfy all allocations. We describe a related system for bounding the stack space requirements which uses the depth of data structures, by expressing potential in terms of maxima as well as sums. This is achieved by adding extra structure to typing contexts (inspired by O'Hearn's bunched typing [2]) to describe the form of the bounds. We will also present the extra steps that must be taken to construct a typing during the analysis.Obtaining bounds on the resource requirements of programs can be crucial for ensuring that they enjoy reliability and security properties, particularly for use in constrained systems such as mobile phones, smartcards and embedded systems. Hofmann and Jost have presented a type-based amortised analysis for finding upper bounds on the heap memory required for programs in a simple functional programming language [1]. The form of these bounds is limited to linear functions with respect to the size of the program's input. Fortunately, this is sufficient for a wide variety of interesting programs. Moreover, the analysis was successfully used to certify such bounds in a Proof Carrying Code system [3].However, it is also important to bound the stack space requirements, especially for functional programs where it is easy to cause excessive stack usage by accident. The Hofmann-Jost analysis has previously been adapted to measure stack space [4,5], but the form of the bounds was again limited to linear functions in terms of the total size of the input.In this work we present a similar analysis where bounds are given as maxplus expressions on the depth of data structures. This is far more precise for programs operating on tree-structured data.Like Hofmann-Jost, our analysis consists of two parts: a type-system which certifies that a given bound really is an upper bound on the stack memory

show abstract

“…For the imperative paradigm, which is closer to the system described here, e.g. [18,19,20] treat memory usage. The problem of component usage in a parallel setting is related to prevention of deadlocks and race conditions.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

A Type System for Usage of Software Components

Hovland

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The aim of this article is to support component-based software engineering by modelling exclusive and inclusive usage of software components. Truong and Bezem describe in several papers abstract languages for component software with the aim to find bounds of the number of instances of components. Their language includes primitives for instantiating and deleting instances of components and operators for sequential, alternative and parallel composition and a scope mechanism. The language is here supplemented with the primitives use , lock and free . The main contribution is a type system which guarantees the safety of usage, in the following way: When a well-typed program executes a subexpression use [x] or lock [x], it is guaranteed that an instance of x is available.

show abstract

Memory Usage Verification for OO Programs

Cited by 45 publications

References 19 publications

Automatic Type Inference for Amortised Heap-Space Analysis

Automatic Type Inference for Amortised Heap-Space Analysis

Amortised Memory Analysis Using the Depth of Data Structures

A Type System for Usage of Software Components

Contact Info

Product

Resources

About