Clément Aubert

ORCID

Publication Activity (10 Years)

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

Top Venues

CoRR

J. Log. Algebraic Methods Program.

CONCUR

Paris 13 University, Villetaneuse, Saint-Denis, Bobigny, France (PHD)

Education History

Paris 13 University, Villetaneuse, Saint-Denis, Bobigny, France

PHD

Publications

Clément Aubert
The correctness of concurrencies in (reversible) concurrent calculi. J. Log. Algebraic Methods Program. 136 (2024)
Clément Aubert
Replications in Reversible Concurrent Calculi. RC (2023)
Clément Aubert, Cinzia Di Giusto, Simon Fowler, Larisa Safina
Proceedings 16th Interaction and Concurrency Experience. CoRR (2023)
Clément Aubert, Peter Browning
Implementation of a Reversible Distributed Calculus. RC (2023)
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
pymwp: A Static Analyzer Determining Polynomial Growth Bounds. ATVA (2023)
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
Distributing and Parallelizing Non-canonical Loops. VMCAI (2023)
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
Realizing Implicit Computational Complexity. CoRR (2022)
Clément Aubert, Ross Horne, Christian Johansen
Diamonds for Security: A Non-Interleaving Operational Semantics for the Applied Pi-Calculus. CONCUR (2022)
Clément Aubert, Ross Horne, Christian Johansen
Bisimulations Respecting Duration and Causality for the Non-interleaving Applied π-Calculus. EXPRESS/SOS (2022)
Clément Aubert, Daniele Varacca
Processes against tests: On defining contextual equivalences. J. Log. Algebraic Methods Program. 129 (2022)
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
A Novel Loop Fission Technique Inspired by Implicit Computational Complexity. CoRR (2022)
Clément Aubert
Concurrencies in Reversible Concurrent Calculi. RC (2022)
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity. CoRR (2022)
Clément Aubert, E. Andrew Balas, Tiffany Townsend, Noah Sleeper, C. J. Tran
Data Integration for the Study of Outstanding Productivity in Biomedical Research. CRIS (2022)
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity. FSCD (2022)
Clément Aubert, Doriana Medic
Enabling Replications and Contexts in Reversible Concurrent Calculus. CoRR (2021)
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
An extended and more practical mwp flow analysis. CoRR (2021)
Clément Aubert, Daniele Varacca
Process, Systems and Tests: Three Layers in Concurrent Computation. ICE (2021)
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
An implementation of flow calculus for complexity analysis (tool paper). CoRR (2021)
Clément Aubert, Doriana Medic
Explicit Identifiers and Contexts in Reversible Concurrent Calculus. RC (2021)
Clément Aubert
Causal Consistent Replication in Reversible Concurrent Calculi. CoRR (2021)
Clément Aubert, Ioana Cristescu
How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation. CONCUR (2020)
Clément Aubert, Ioana Cristescu
Structural Equivalences for Reversible Calculi of Communicating Systems (Oral communication). CoRR (2020)
Clément Aubert, Ioana Cristescu
How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation. CoRR (2020)
Clément Aubert
Categories for Me, and You? CoRR (2019)
Clément Aubert, Ioana Cristescu
History-Preserving Bisimulations on Reversible Calculus of Communicating Systems. CoRR (2018)
Clément Aubert, Marc Bagnol
Unification and Logarithmic Space. CoRR (2018)
Clément Aubert, Marc Bagnol
Unification and Logarithmic Space. Log. Methods Comput. Sci. 14 (3) (2018)
Clément Aubert, Ioana Cristescu
Contextual equivalences in configuration structures and reversibility. J. Log. Algebraic Methods Program. 86 (1) (2017)
Clément Aubert, Thomas Seiller
Logarithmic space and permutations. Inf. Comput. 248 (2016)
Clément Aubert, Thomas Seiller
Characterizing co-NL by a group action. Math. Struct. Comput. Sci. 26 (4) (2016)
Clément Aubert, Marc Bagnol, Thomas Seiller
Unary Resolution: Characterizing Ptime. FoSSaCS (2016)
Clément Aubert
An in-between "implicit" and "explicit" complexity: Automata. CoRR (2015)
Clément Aubert, Marc Bagnol, Thomas Seiller
Memoization for Unary Logic Programming: Characterizing PTIME. CoRR (2015)
Clément Aubert, Ioana Cristescu
Contextual equivalences in configuration structures and reversibility. CoRR (2015)
Clément Aubert, Ioana Cristescu
Reversible Barbed Congruence on Configuration Structures. ICE (2015)
Clément Aubert, Marc Bagnol, Paolo Pistone, Thomas Seiller
Logic Programming and Logarithmic Space. CoRR (2014)
Clément Aubert, Marc Bagnol
Unification and Logarithmic Space. CoRR (2014)
Clément Aubert, Marc Bagnol, Paolo Pistone, Thomas Seiller
Logic Programming and Logarithmic Space. APLAS (2014)
Clément Aubert, Marc Bagnol
Unification and Logarithmic Space. RTA-TLCA (2014)
Thomas Seiller, Clément Aubert
Logarithmic Space and Permutations CoRR (2013)
Clément Aubert, Thomas Seiller
Characterizing co-NL by a group action CoRR (2012)
Clément Aubert
Sublogarithmic uniform Boolean proof nets DICE (2011)

Clément Aubert.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Clément Aubert