Type-Based Amortised Heap-Space Analysis

Hofmann, Martin; Jost, Steffen

doi:10.1007/11693024_3

Cited by 90 publications

(81 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In previous work [7][8][9][10] we and others argued that the method of amortised analysis [11,12] might be of help here. Therein, data structures are assigned non-negative numbers, called potential, in an a priori arbitrary fashion.…”

Section: Introductionmentioning

confidence: 78%

“…We build upon a system of refinement types for amortised analysis for a Java-like language called Resource Aware JAva (RAJA) [7]. This is a powerful type system that can capture the heap-space requirements of many programs.…”

Section: Introductionmentioning

confidence: 99%

“…The type system that we present in this paper is a slightly modified version of the original type system from [7]: we present syntax-directed typing rules that make the system more suitable for automatic type inference. We also introduce polymorphic method types that enable a modular analysis.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Automatic Type Inference for Amortised Heap-Space Analysis

Hofmann

Rodriguez²

2013

Programming Languages and Systems

Self Cite

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: Introductionmentioning

confidence: 78%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Automatic Type Inference for Amortised Heap-Space Analysis

Hofmann

Rodriguez²

2013

Programming Languages and Systems

Self Cite

View full text Add to dashboard Cite

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

“…Note that the programming disciplines induced by these systems are quite restrictive, but some of these characterizations have in a second step led to more flexible criteria for statically checking complexity bounds on programs: ramification and safe recursion have inspired the work on interpretation methods for complexity [BMM11] on the one-hand, and linear type systems for nonsize-increasing computation [Hof03] on the other, which itself has led to typing methods for amortized complexity analysis [HJ06,HAH11].…”

Section: Introductionmentioning

confidence: 99%

Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy

Baillot

2011

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. Elementary linear logic is a simple variant of linear logic, introduced by Girard and which characterizes in the proofs-as-programs approach the class of elementary functions (computable in time bounded by a tower of exponentials of fixed height). Other systems, like light linear logic have then been defined to capture in a similar way polynomial time functions, but at the price of either a more complicated syntax or of more involved encodings. Such logical systems can then be the basis of type systems to guarantee statically complexity properties on lambdacalculus. Our goal here is to show that despite its simplicity, elementary linear logic can nevertheless be used as a common framework to characterize the different levels of a hierarchy of deterministic time complexity classes, within elementary time. We consider a variant of this logic with type fixpoints and weakening (elementary affine logic with fixpoints). The key ingredients are then the choice of specific types and a finer study of the normalization procedure on proof-nets. We characterize in this way the class P of polynomial time predicates and more generally the hierarchy of classes k-EXP, for k ≥ 0, where k-EXP is the union of DTIME(2 n i k ), for i ≥ 1.

show abstract

Type-Based Amortised Heap-Space Analysis

Cited by 90 publications

References 19 publications

Automatic Type Inference for Amortised Heap-Space Analysis

Automatic Type Inference for Amortised Heap-Space Analysis

A Type System for Usage of Software Components

Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy

Contact Info

Product

Resources

About