Romain Péchoux

62 papers A* 3A 1B 11C 6Misc 2Journal 32Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
A Polytime Quantum Programming Language.
ACM Trans. Quantum Comput.
Emmanuel Hainry, Romain Péchoux, Mário Silva
2025 J jnl
A Quantum Programming Language for Coherent Control.
CoRR
Kathleen Barsse, Romain Péchoux, Simon Perdrix
2025 J jnl
A programming language combining quantum and classical control.
CoRR
Kinnari Dave, Louis Lemonnier, Romain Péchoux, Vladimir Zamdzhiev
2025 B conf
Branch Sequentialization in Quantum Polytime.
FSCD
Emmanuel Hainry, Romain Péchoux, Mário Silva
2025 B conf
Combining quantum and classical control: syntax, semantics and adequacy.
FoSSaCS
Kinnari Dave, Louis Lemonnier, Romain Péchoux, Vladimir Zamdzhiev
2025 J jnl
Complete and tractable machine-independent characterizations of second-order polytime.
Log. Methods Comput. Sci.
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2025 J jnl
Expectation-based Analysis of Higher-Order Quantum Programs.
CoRR
Martin Avanzini, Alejandro Díaz-Caro, Emmanuel Hainry, Romain Péchoux
2025 B conf
Quantum Programming in Polylogarithmic Time.
MFCS
Florent Ferrari, Emmanuel Hainry, Romain Péchoux, Mário Silva
2025 J jnl
Quantum Programming in Polylogarithmic Time.
CoRR
Florent Ferrari, Emmanuel Hainry, Romain Péchoux, Mário Silva
2025 J jnl
Resource-Aware Hybrid Quantum Programming with General Recursion and Quantum Control.
CoRR
Kostia Chardonnet, Emmanuel Hainry, Romain Péchoux, Thomas Vinet
2024 J jnl
Branch Sequentialization in Quantum Polytime.
CoRR
Emmanuel Hainry, Romain Péchoux, Mário Alberto Machado da Silva
2024 A* conf
Declassification Policy for Program Complexity Analysis.
LICS
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2024 J jnl
Declassification Policy for Program Complexity Analysis.
CoRR
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2024 — conf
On the Hardness of Analyzing Quantum Programs Quantitatively.
ESOP (2)
Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix
2023 J jnl
A General Noninterference Policy for Polynomial Time.
Proc. ACM Program. Lang.
Emmanuel Hainry, Romain Péchoux
2023 B conf
A Programming Language Characterizing Quantum Polynomial Time.
FoSSaCS
Emmanuel Hainry, Romain Péchoux, Mário Silva
2023 J jnl
A feasible and unitary programming language with quantum control.
CoRR
Alejandro Díaz-Caro, Emmanuel Hainry, Romain Péchoux, Mário Silva
2023 J jnl
On the Hardness of Analyzing Quantum Programs Quantitatively.
CoRR
Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix
2022 J jnl
A programming language characterizing quantum polynomial time.
CoRR
Emmanuel Hainry, Romain Péchoux, Mário Silva
2022 J jnl
A tier-based typed programming language characterizing Feasible Functionals.
Log. Methods Comput. Sci.
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2022 B conf
Complete and tractable machine-independent characterizations of second-order polytime.
FoSSaCS
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2022 J jnl
Complete and tractable machine-independent characterizations of second-order polytime.
CoRR
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2022 A* conf
Quantum Expectation Transformers for Cost Analysis.
LICS
Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev
2022 J jnl
Quantum Expectation Transformers for Cost Analysis.
CoRR
Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev
2021 J jnl
A tier-based typed programming language characterizing Feasible Functionals.
CoRR
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2021 C conf
ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs.
ICTAC
Emmanuel Hainry, Emmanuel Jeandel, Romain Péchoux, Olivier Zeyen
2020 A* conf
A tier-based typed programming language characterizing Feasible Functionals.
LICS
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2020 — book
Complexité implicite : bilan et perspectives. (Implicit Computational Complexity: past and future).
Romain Péchoux
2020 J jnl
On the efficiency of normal form systems for representing Boolean functions.
Theor. Comput. Sci.
Miguel Couceiro, Erkko Lehtonen, Pierre Mercuriali, Romain Péchoux
2020 Misc conf
Polynomial Time over the Reals with Parsimony.
FLOPS
Emmanuel Hainry, Damiano Mazza, Romain Péchoux
2020 B conf
Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory.
FoSSaCS
Romain Péchoux, Simon Perdrix, Mathys Rennela, Vladimir Zamdzhiev
2020 J jnl
Theory of higher order interpretations and application to Basic Feasible Functions.
Log. Methods Comput. Sci.
Emmanuel Hainry, Romain Péchoux
2019 J jnl
On the Complexity of Minimizing Median Normal Forms of Monotone Boolean Functions and Lattice Polynomials.
J. Multiple Valued Log. Soft Comput.
Miguel Couceiro, Pierre Mercuriali, Romain Péchoux, Abdallah Saffidine
2019 J jnl
Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory.
CoRR
Romain Péchoux, Simon Perdrix, Mathys Rennela, Vladimir Zamdzhiev
2018 J jnl
A Type-Based Complexity Analysis of Object Oriented Programs.
CoRR
Emmanuel Hainry, Romain Péchoux
2018 J jnl
A type-based complexity analysis of Object Oriented programs.
Inf. Comput.
Emmanuel Hainry, Romain Péchoux
2018 J jnl
Theory of higher order interpretations and application to Basic Feasible Functions.
CoRR
Emmanuel Hainry, Romain Péchoux
2017 B conf
Higher order interpretation for higher order complexity.
LPAR
Emmanuel Hainry, Romain Péchoux
2017 — conf
Median Based Calculus for Lattice Polynomials and Monotone Boolean Functions.
ISMVL
Miguel Couceiro, Pierre Mercuriali, Romain Péchoux, Abdallah Saffidine
2015 A conf
Algebras and coalgebras in the light affine Lambda calculus.
ICFP
Marco Gaboardi, Romain Péchoux
2015 J jnl
Characterizing polynomial time complexity of stream programs using interpretations.
Theor. Comput. Sci.
Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux
2015 B conf
Objects in Polynomial Time.
APLAS
Emmanuel Hainry, Romain Péchoux
2015 J jnl
On bounding space usage of streams using interpretation analysis.
Sci. Comput. Program.
Marco Gaboardi, Romain Péchoux
2014 C conf
A Categorical Treatment of Malicious Behavioral Obfuscation.
TAMC
Romain Péchoux, Thanh Dinh Ta
2014 C conf
Complexity Information Flow in a Multi-threaded Imperative Language.
TAMC
Jean-Yves Marion, Romain Péchoux
2013 J jnl
Synthesis of sup-interpretations: A survey.
Theor. Comput. Sci.
Romain Péchoux
2013 B conf
Type-Based Complexity Analysis for Fork Processes.
FoSSaCS
Emmanuel Hainry, Jean-Yves Marion, Romain Péchoux
2012 J jnl
Complexity Information Flow in a Multi-threaded Imperative Language
CoRR
Jean-Yves Marion, Romain Péchoux
2012 J jnl
Synthesis of sup-interpretations: a survey
CoRR
Romain Péchoux
2010 — conf
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity.
ISAAC (1)
Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux
2009 — conf
Global and Local Space Properties of Stream Programs.
FOPARA
Marco Gaboardi, Romain Péchoux
2009 J jnl
Sup-interpretations, a semantic method for static analysis of program resources.
ACM Trans. Comput. Log.
Jean-Yves Marion, Romain Péchoux
2009 B conf
Upper Bounds on Stream I/O Using Semantic Interpretations.
CSL
Marco Gaboardi, Romain Péchoux
2008 C conf
A Characterization of NCk.
TAMC
Jean-Yves Marion, Romain Péchoux
2008 — conf
Analyzing the Implicit Computational Complexity of object-oriented programs.
FSTTCS
Jean-Yves Marion, Romain Péchoux
2008 C conf
Characterizations of polynomial complexity classes with a better intensionality.
PPDP
Jean-Yves Marion, Romain Péchoux
2007 — —
Analyse de la complexité des programmes par interprétation sémantique. (Program complexity analysis by semantics interpretation).
Romain Péchoux
2007 C conf
Quasi-interpretation Synthesis by Decomposition.
ICTAC
Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux
2007 J jnl
Resource control of object-oriented programs
CoRR
Jean-Yves Marion, Romain Péchoux
2006 B conf
A Characterization of Alternating Log Time by First Order Functional Programs.
LPAR
Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux
2006 J jnl
Quasi-friendly sup-interpretations
CoRR
Jean-Yves Marion, Romain Péchoux
2006 Misc conf
Resource Analysis by Sup-interpretation.
FLOPS
Jean-Yves Marion, Romain Péchoux