16 citations · 41 across the 8 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2018
A Type-Based Complexity Analysis of Object Oriented Programs
Emmanuel Hainry, Romain Péchoux
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 polynomia…
cs.PL2007★ 2 cited
Resource control of object-oriented programs
Jean-Yves Marion, Romain Pechoux
A sup-interpretation is a tool which provides an upper bound on the size of a value computed by some symbol of a program. Sup-interpretations have shown their interest to deal with…