Romain Péchoux

ORCID

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 31

Top Venues

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

Education History

National Polytechnic Institute of Lorraine, Nancy, France

PHD

Publications

Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix
On the Hardness of Analyzing Quantum Programs Quantitatively. ESOP (2) (2024)
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)
Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix
On the Hardness of Analyzing Quantum Programs Quantitatively. CoRR (2023)
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)
Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev
Quantum Expectation Transformers for Cost Analysis. LICS (2022)
Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev
Quantum Expectation Transformers for Cost Analysis. 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)
Miguel Couceiro, Erkko Lehtonen, Pierre Mercuriali, Romain Péchoux
On the efficiency of normal form systems for representing Boolean functions. Theor. Comput. Sci. 813 (2020)
Romain Péchoux, Simon Perdrix, Mathys Rennela, Vladimir Zamdzhiev
Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory. FoSSaCS (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)
Miguel Couceiro, Pierre Mercuriali, Romain Péchoux, Abdallah Saffidine
On the Complexity of Minimizing Median Normal Forms of Monotone Boolean Functions and Lattice Polynomials. J. Multiple Valued Log. Soft Comput. 33 (3) (2019)
Romain Péchoux, Simon Perdrix, Mathys Rennela, Vladimir Zamdzhiev
Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory. CoRR (2019)
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)
Miguel Couceiro, Pierre Mercuriali, Romain Péchoux, Abdallah Saffidine
Median Based Calculus for Lattice Polynomials and Monotone Boolean Functions. ISMVL (2017)
Marco Gaboardi, Romain Péchoux
On bounding space usage of streams using interpretation analysis. Sci. Comput. Program. 111 (2015)
Marco Gaboardi, Romain Péchoux
Algebras and coalgebras in the light affine Lambda calculus. ICFP (2015)
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)
Romain Péchoux, Thanh Dinh Ta
A Categorical Treatment of Malicious Behavioral Obfuscation. TAMC (2014)
Jean-Yves Marion, Romain Péchoux
Complexity Information Flow in a Multi-threaded Imperative Language. TAMC (2014)
Emmanuel Hainry, Jean-Yves Marion, Romain Péchoux
Type-Based Complexity Analysis for Fork Processes. FoSSaCS (2013)
Romain Péchoux
Synthesis of sup-interpretations: A survey. Theor. Comput. Sci. 467 (2013)
Romain Péchoux
Synthesis of sup-interpretations: a survey CoRR (2012)
Jean-Yves Marion, Romain Péchoux
Complexity Information Flow in a Multi-threaded Imperative Language CoRR (2012)
Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity. ISAAC (1) (2010)
Jean-Yves Marion, Romain Péchoux
Sup-interpretations, a semantic method for static analysis of program resources. ACM Trans. Comput. Log. 10 (4) (2009)
Marco Gaboardi, Romain Péchoux
Upper Bounds on Stream I/O Using Semantic Interpretations. CSL (2009)
Marco Gaboardi, Romain Péchoux
Global and Local Space Properties of Stream Programs. FOPARA (2009)
Jean-Yves Marion, Romain Péchoux
A Characterization of NCk. TAMC (2008)
Jean-Yves Marion, Romain Péchoux
Characterizations of polynomial complexity classes with a better intensionality. PPDP (2008)
Jean-Yves Marion, Romain Péchoux
Analyzing the Implicit Computational Complexity of object-oriented programs. FSTTCS (2008)
Jean-Yves Marion, Romain Péchoux
Resource control of object-oriented programs CoRR (2007)
Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux
Quasi-interpretation Synthesis by Decomposition. ICTAC (2007)
Jean-Yves Marion, Romain Péchoux
Quasi-friendly sup-interpretations CoRR (2006)
Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux
A Characterization of Alternating Log Time by First Order Functional Programs. LPAR (2006)
Jean-Yves Marion, Romain Péchoux
Resource Analysis by Sup-interpretation. FLOPS (2006)

Romain Péchoux.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Romain Péchoux