Amaury Pouly

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 49

Top Venues

Universidad do Algarve, Faro, Portugal (PHD)

Education History

Universidad do Algarve, Faro, Portugal

PHD

Publications

Amaury Pouly, Yixin Shen
Provable Dual Attacks on Learning with Errors. EUROCRYPT (6) (2024)
Christoph Haase, Alessio Mansutti, Amaury Pouly
On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories. CoRR (2024)
Amaury Pouly, Yixin Shen
Provable Dual Attacks on Learning with Errors. IACR Cryptol. ePrint Arch. 2023 (2023)
Olivier Bournez, Riccardo Gozzi, Daniel Silva Graça, Amaury Pouly
A continuous characterization of PSPACE using polynomial ordinary differential equations. J. Complex. 77 (2023)
Christoph Haase, Alessio Mansutti, Amaury Pouly
On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract). MFCS (2023)
Ehud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell
On Strongest Algebraic Program Invariants. J. ACM 70 (5) (2023)
Klara Nosan, Amaury Pouly, Mahsa Shirmohammadi, James Worrell
The Membership Problem for Hypergeometric Sequences with Rational Parameters. CoRR (2022)
Klara Nosan, Amaury Pouly, Mahsa Shirmohammadi, James Worrell
The Membership Problem for Hypergeometric Sequences with Rational Parameters. ISSAC (2022)
Klara Nosan, Amaury Pouly, Sylvain Schmitz, Mahsa Shirmohammadi, James Worrell
On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices. ISSAC (2022)
Klara Nosan, Amaury Pouly, Mahsa Shirmohammadi, James Worrell
On the Computation of the Algebraic Closure of Finitely Generated Groups of Matrices. CoRR (2021)
Mohan Dantam, Amaury Pouly
On the decidability of reachability in continuous time linear time-invariant systems. HSCC (2021)
Rupak Majumdar, Joël Ouaknine, Amaury Pouly, James Worrell
Algebraic Invariants for Linear Hybrid Automata. CONCUR (2020)
Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, Amaury Pouly, David Purser, Markus A. Whiteland
Reachability in Dynamical Systems with Rounding. CoRR (2020)
Mohan Dantam, Amaury Pouly
On the Decidability of Reachability in Continuous Time Linear Time-Invariant Systems. CoRR (2020)
Olivier Bournez, Amaury Pouly
A Universal Ordinary Differential Equation. Log. Methods Comput. Sci. 16 (1) (2020)
Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, Amaury Pouly, David Purser, Markus A. Whiteland
Reachability in Dynamical Systems with Rounding. FSTTCS (2020)
Nathanaël Fijalkow, Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell
On the decidability of reachability in linear time-invariant systems. HSCC (2019)
Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell
On the Decidability of Membership in Matrix-exponential Semigroups. J. ACM 66 (3) (2019)
Rupak Majumdar, Joël Ouaknine, Amaury Pouly, James Worrell
Algebraic Invariants for Linear Hybrid Automata. CoRR (2019)
Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. Theory Comput. Syst. 63 (5) (2019)
Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
On the Monniaux Problem in Abstract Interpretation. CoRR (2019)
Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
On the Monniaux Problem in Abstract Interpretation. SAS (2019)
Olivier Bournez, Amaury Pouly
A Survey on Analog Models of Computation. CoRR (2018)
Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell
Model Checking Flat Freeze LTL on One-Counter Automata. Log. Methods Comput. Sci. 14 (4) (2018)
Ehud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell
Polynomial Invariants for Affine Programs. CoRR (2018)
Nathanaël Fijalkow, Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell
On the Decidability of Reachability in Linear Time-Invariant Systems. CoRR (2018)
Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly
On the complexity of bounded time and precision reachability for piecewise affine systems. Theor. Comput. Sci. 735 (2018)
Ehud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell
Polynomial Invariants for Affine Programs. LICS (2018)
Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. CoRR (2017)
Olivier Bournez, Amaury Pouly
A Universal Ordinary Differential Equation. CoRR (2017)
Marcelo Forets, Amaury Pouly
Explicit Error Bounds for Carleman Linearization. CoRR (2017)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
On the functions generated by the general purpose analog computer. Inf. Comput. 257 (2017)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. J. ACM 64 (6) (2017)
Olivier Bournez, Amaury Pouly
A Universal Ordinary Differential Equation. ICALP (2017)
Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. STACS (2017)
François Fages, Guillaume Le Guludec, Olivier Bournez, Amaury Pouly
Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs. CMSB (2017)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. CoRR (2016)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version). CoRR (2016)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Computing with polynomial ordinary differential equations. J. Complex. 36 (2016)
Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell
Model Checking Flat Freeze LTL on One-Counter Automata. CoRR (2016)
Amaury Pouly
Computational complexity of solving polynomial differential equations over unbounded domains with non-rational coefficients. CoRR (2016)
Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. CoRR (2016)
Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell
Solvability of Matrix-Exponential Equations. CoRR (2016)
Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell
Model Checking Flat Freeze LTL on One-Counter Automata. CONCUR (2016)
Amaury Pouly, Daniel Silva Graça
Computational complexity of solving polynomial differential equations over unbounded domains. Theor. Comput. Sci. 626 (2016)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
On the Functions Generated by the General Purpose Analog Computer. CoRR (2016)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length: The General Purpose Analog Computer and Computable Analysis Are Two Efficiently Equivalent Models of Computations. ICALP (2016)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Computing with Polynomial Ordinary Differential Equations. CoRR (2016)
Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell
Solvability of Matrix-Exponential Equations. LICS (2016)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains. MACIS (2015)
Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. RP (2014)
Amaury Pouly, Daniel Silva Graça
Computational complexity of solving elementary differential equations over unbounded domains. CoRR (2014)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly, Ning Zhong
Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems. CiE (2013)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer. TAMC (2013)
Amaury Pouly, Olivier Bournez, Daniel Silva Graça
Turing machines can be efficiently simulated by the General Purpose Analog Computer. CoRR (2012)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
On the complexity of solving initial value problems CoRR (2012)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
On the complexity of solving initial value problems. ISSAC (2012)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains. MFCS (2011)

Amaury Pouly.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Amaury Pouly