Amaury Pouly

发表

Analog models of computations \& Effective Church Turing Thesis: Efficient simulation of Turing machines by the General Purpose Analog Computer

Amaury Pouly, Olivier Bournez, Daniel S. Graça, 2012 .

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

Amaury Pouly, Olivier Bournez, Daniel S. Graça, 2016, ICALP.

Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains

Amaury Pouly, Olivier Bournez, Daniel S. Graça, 2011, MFCS.

Proceedings of the 27th International Conference on Concurrency Theory (CONCUR 2016)

Joël Ouaknine, James Worrell, Amaury Pouly, 2016, CONCUR 2016.

A Universal Ordinary Differential Equation pdf

Amaury Pouly, Olivier Bournez, Olivier Bournez, 2017, ICALP.

Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer

Amaury Pouly, Olivier Bournez, Daniel S. Graça, 2012, TAMC.

Reachability in Dynamical Systems with Rounding

Christel Baier, Amaury Pouly, Markus A. Whiteland, 2020, FSTTCS.

On the complexity of bounded time and precision reachability for piecewise affine systems

Walid Gomaa, Amaury Pouly, Olivier Bournez, 2016, Theor. Comput. Sci..

Reachability Problems

Walid Gomaa, Amaury Pouly, Olivier Bournez, 2014, Lecture Notes in Computer Science.

A Survey on Analog Models of Computation pdf

Amaury Pouly, Olivier Bournez, Olivier Bournez, 2018, Theory and Applications of Computability.

A Universal Ordinary Differential Equation

Amaury Pouly, Olivier Bournez, 2020, Log. Methods Comput. Sci..

Continuous models of computation: from computability to complexity. (Modèles de calculs à temps continu: de la calculabilité à la complexité)

Amaury Pouly, A. Pouly, 2015 .

Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem

Joël Ouaknine, James Worrell, Pierre Ohlmann, 2017, STACS.

Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem

Joël Ouaknine, James Worrell, Pierre Ohlmann, 2019, Theory of Computing Systems.

Explicit Error Bounds for Carleman Linearization pdf

Amaury Pouly, Marcelo Forets, M. Forets, 2017, ArXiv.

On the Monniaux Problem in Abstract Interpretation pdf

Nathanael Fijalkow, Pierre Ohlmann, Amaury Pouly, 2019, SAS.

On the complexity of solving initial value problems

Amaury Pouly, Olivier Bournez, Daniel S. Graça, 2012, ISSAC.

Analog models of computations

Amaury Pouly, Olivier Bournez, Daniel S. Graça, 2012 .

Solvability of Matrix-Exponential Equations

Joël Ouaknine, João Sousa Pinto, James Worrell, 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

On The Complexity of Bounded Time Reachability for Piecewise Affine Systems

Walid Gomaa, Amaury Pouly, Olivier Bournez, 2014, RP.

Model Checking Flat Freeze LTL on One-Counter Automata

Joël Ouaknine, James Worrell, Amaury Pouly, 2018, Log. Methods Comput. Sci..

Computing with Polynomial Ordinary Differential Equations pdf

Amaury Pouly, Olivier Bournez, Daniel S. Graça, 2016, J. Complex..

Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems

Amaury Pouly, Olivier Bournez, Ning Zhong, 2013, CiE.

On the Decidability of Membership in Matrix-exponential Semigroups

Joël Ouaknine, João Sousa Pinto, James Worrell, 2019, J. ACM.

Polynomial Invariants for Affine Programs

Joël Ouaknine, James Worrell, Ehud Hrushovski, 2018, LICS.

Algebraic Invariants for Linear Hybrid Automata

Joël Ouaknine, James Worrell, Rupak Majumdar, 2020, CONCUR.

On the Functions Generated by the General Purpose Analog Computer

Amaury Pouly, Olivier Bournez, Daniel S. Graça, 2016, Inf. Comput..

Model Checking Flat Freeze LTL on One-Counter Automata pdf

Joël Ouaknine, James Worrell, Amaury Pouly, 2016, CONCUR.

On the Decidability of Reachability in Continuous Time Linear Time-Invariant Systems pdf

Amaury Pouly, Mohan Dantam, 2020, ArXiv.

On the decidability of reachability in linear time-invariant systems

Joël Ouaknine, João Sousa Pinto, James Worrell, 2018, HSCC.

Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains

Amaury Pouly, Olivier Bournez, Daniel S. Graça, 2015, MACIS.

Computational complexity of solving elementary differential equations over unbounded domains pdf

Amaury Pouly, Daniel S. Graça, D. Graça, 2014, ArXiv.

Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs

François Fages, Amaury Pouly, Olivier Bournez, 2017, CMSB.

Computational complexity of solving polynomial differential equations over unbounded domains

Amaury Pouly, D. Graça, Amaury Pouly, 2014, Theor. Comput. Sci..

Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length

Amaury Pouly, Olivier Bournez, Daniel S. Graça, 2016, J. ACM.

On the Computation of the Algebraic Closure of Finitely Generated Groups of Matrices pdf

James Worrell, Amaury Pouly, Mahsa Shirmohammadi, 2021, ArXiv.

On the decidability of reachability in continuous time linear time-invariant systems

Amaury Pouly, Mohan Dantam, 2021, HSCC.