Emmanuel Hainry

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 21

Top Venues

CoRR

FoSSaCS

LICS

Log. Methods Comput. Sci.

National Polytechnic Institute of Lorraine, Nancy, France (PHD)

Education History

National Polytechnic Institute of Lorraine, Nancy, France

PHD

Publications

Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
Declassification Policy for Program Complexity Analysis. LICS (2024)
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
Declassification Policy for Program Complexity Analysis. CoRR (2024)
Alejandro Díaz-Caro, Emmanuel Hainry, Romain Péchoux, Mário Silva
A feasible and unitary programming language with quantum control. CoRR (2023)
Emmanuel Hainry, Romain Péchoux, Mário Silva
A Programming Language Characterizing Quantum Polynomial Time. FoSSaCS (2023)
Emmanuel Hainry, Romain Péchoux
A General Noninterference Policy for Polynomial Time. Proc. ACM Program. Lang. 7 (POPL) (2023)
Emmanuel Hainry, Romain Péchoux, Mário Silva
A programming language characterizing quantum polynomial time. CoRR (2022)
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
Complete and tractable machine-independent characterizations of second-order polytime. FoSSaCS (2022)
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
Complete and tractable machine-independent characterizations of second-order polytime. CoRR (2022)
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
A tier-based typed programming language characterizing Feasible Functionals. Log. Methods Comput. Sci. 18 (1) (2022)
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
A tier-based typed programming language characterizing Feasible Functionals. CoRR (2021)
Emmanuel Hainry, Emmanuel Jeandel, Romain Péchoux, Olivier Zeyen
ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs. ICTAC (2021)
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
A tier-based typed programming language characterizing Feasible Functionals. LICS (2020)
Emmanuel Hainry, Romain Péchoux
Theory of higher order interpretations and application to Basic Feasible Functions. Log. Methods Comput. Sci. 16 (4) (2020)
Emmanuel Hainry, Damiano Mazza, Romain Péchoux
Polynomial Time over the Reals with Parsimony. FLOPS (2020)
Emmanuel Hainry, Romain Péchoux
A Type-Based Complexity Analysis of Object Oriented Programs. CoRR (2018)
Emmanuel Hainry, Romain Péchoux
A type-based complexity analysis of Object Oriented programs. Inf. Comput. 261 (2018)
Emmanuel Hainry, Romain Péchoux
Theory of higher order interpretations and application to Basic Feasible Functions. CoRR (2018)
Emmanuel Hainry, Romain Péchoux
Higher order interpretation for higher order complexity. LPAR (2017)
Olivier Bournez, Walid Gomaa, Emmanuel Hainry
A Framework for Algebraic Characterizations in Recursive Analysis. CoRR (2016)
Emmanuel Hainry, Romain Péchoux
Objects in Polynomial Time. APLAS (2015)
Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux
Characterizing polynomial time complexity of stream programs using interpretations. Theor. Comput. Sci. 585 (2015)
Olivier Bournez, Daniel Silva Graça, Emmanuel Hainry
Computation with perturbed dynamical systems. J. Comput. Syst. Sci. 79 (5) (2013)
Emmanuel Hainry, Jean-Yves Marion, Romain Péchoux
Type-Based Complexity Analysis for Fork Processes. FoSSaCS (2013)
Olivier Bournez, Walid Gomaa, Emmanuel Hainry
Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions. Int. J. Unconv. Comput. 7 (5) (2011)
Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity. ISAAC (1) (2010)
Olivier Bournez, Daniel Silva Graça, Emmanuel Hainry
Robust Computations with Dynamical Systems. MFCS (2010)
Emmanuel Hainry
Reachability in Linear Dynamical Systems. CiE (2008)
Emmanuel Hainry
Computing Omega-Limit Sets in Linear Dynamical Systems. UC (2008)
Olivier Bournez, Manuel Lameiras Campagnolo, Daniel Silva Graça, Emmanuel Hainry
Polynomial differential equations compute all real computable functions on computable compact intervals. J. Complex. 23 (3) (2007)
Olivier Bournez, Emmanuel Hainry
On the Computational Capabilities of Several Models. MCU (2007)
Olivier Bournez, Manuel Lameiras Campagnolo, Daniel Silva Graça, Emmanuel Hainry
The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation. TAMC (2006)
Olivier Bournez, Emmanuel Hainry
Recursive Analysis Characterized as a Class of Real Recursive Functions. Fundam. Informaticae 74 (4) (2006)
Olivier Bournez, Emmanuel Hainry
Elementarily computable functions over the real numbers and R-sub-recursive functions. Theor. Comput. Sci. 348 (2-3) (2005)
Olivier Bournez, Emmanuel Hainry
An Analog Characterization of Elementarily Computable Functions over the Real Numbers. ICALP (2004)
Olivier Bournez, Emmanuel Hainry
Real Recursive Functions and Real Extensions of Recursive Functions. MCU (2004)

Emmanuel Hainry.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Emmanuel Hainry