A Type-Based Complexity Analysis of Object Oriented Programs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Information and Computation Year : 2018

A Type-Based Complexity Analysis of Object Oriented Programs


A type system is introduced for a generic Object Oriented programming language in order to infer resource upper bounds. A sound andcomplete characterization of the set of polynomial time computable functions is obtained. As a consequence, the heap-space and thestack-space requirements of typed programs are also bounded polynomially. This type system is inspired by previous works on ImplicitComputational Complexity, using tiering and non-interference techniques. The presented methodology has several advantages. First, itprovides explicit big $O$ polynomial upper bounds to the programmer, hence its use could allow the programmer to avoid memory errors.Second, type checking is decidable in polynomial time. Last, it has a good expressivity since it analyzes most object oriented featureslike inheritance, overload, override and recursion. Moreover it can deal with loops guarded by objects and can also be extended tostatements that alter the control flow like break or return.
Fichier principal
Vignette du fichier
Object.pdf (460.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01712506 , version 1 (19-02-2018)



Emmanuel Hainry, Romain Péchoux. A Type-Based Complexity Analysis of Object Oriented Programs. Information and Computation, 2018, Information and Computation, 261 (1), pp.78-115. ⟨10.1016/j.ic.2018.05.006⟩. ⟨hal-01712506⟩
189 View
337 Download



Gmail Facebook X LinkedIn More