16 citations · 41 across the 8 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2012★ 9 cited
Synthesis of sup-interpretations: a survey
Romain Péchoux
In this paper, we survey the complexity of distinct methods that allow the programmer to synthesize a sup-interpretation, a function providing an upper- bound on the size of the ou…
cs.CC2012
Complexity Information Flow in a Multi-threaded Imperative Language
Jean-Yves Marion, Romain Péchoux
We propose a type system to analyze the time consumed by multi-threaded imperative programs with a shared global memory, which delineates a class of safe multi-threaded programs. W…
cs.CC2006
Quasi-friendly sup-interpretations
Jean-Yves Marion, Romain Pechoux
In a previous paper, the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static analysi…