2 papers
cs.LO2024
Declassification Policy for Program Complexity Analysis
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion +1
In automated complexity analysis, noninterference-based type systems statically guarantee, via soundness, the property that well-typed programs compute functions of a given complex…
cs.LO2016
A Framework for Algebraic Characterizations in Recursive Analysis
Olivier Bournez, Walid Gomaa, Emmanuel Hainry
Algebraic characterizations of the computational aspects of functions defined over the real numbers provide very effective tool to understand what computability and complexity over…