Clément Aubert

According to our database, Clément Aubert authored at least 35 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

The correctness of concurrencies in (reversible) concurrent calculi.

Clément Aubert

J. Log. Algebraic Methods Program., January, 2024

Dependence and Independence for Reversible Process Calculi.

Clément Aubert, Iain Phillips, Irek Ulidowski

CoRR, 2024

2023

Distributing and Parallelizing Non-canonical Loops.

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2023

Implementation of a Reversible Distributed Calculus.

Clément Aubert, Peter Browning

Proceedings of the Reversible Computation - 15th International Conference, 2023

Replications in Reversible Concurrent Calculi.

Clément Aubert

Proceedings of the Reversible Computation - 15th International Conference, 2023

pymwp: A Static Analyzer Determining Polynomial Growth Bounds.

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller

Proceedings of the Automated Technology for Verification and Analysis, 2023

2022

Processes against tests: On defining contextual equivalences.

Clément Aubert, Daniele Varacca

J. Log. Algebraic Methods Program., 2022

Bisimulations Respecting Duration and Causality for the Non-interleaving Applied π-Calculus.

Clément Aubert, Ross Horne, Christian Johansen

Proceedings of the Proceedings Combined 29th International Workshop on Expressiveness in Concurrency and 19th Workshop on Structural Operational Semantics, 2022

A Novel Loop Fission Technique Inspired by Implicit Computational Complexity.

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller

CoRR, 2022

Realizing Implicit Computational Complexity.

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller

CoRR, 2022

Concurrencies in Reversible Concurrent Calculi.

Clément Aubert

Proceedings of the Reversible Computation - 14th International Conference, 2022

mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity.

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller

Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

Data Integration for the Study of Outstanding Productivity in Biomedical Research.

Clément Aubert, E. Andrew Balas, Tiffany Townsend, Noah Sleeper, C. J. Tran

Proceedings of the 15th International Conference on Current Research Information Systems, 2022

Diamonds for Security: A Non-Interleaving Operational Semantics for the Applied Pi-Calculus.

Clément Aubert, Ross Horne, Christian Johansen

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021

Causal Consistent Replication in Reversible Concurrent Calculi.

Clément Aubert

CoRR, 2021

An implementation of flow calculus for complexity analysis (tool paper).

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller

CoRR, 2021

An extended and more practical mwp flow analysis.

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller

CoRR, 2021

Enabling Replications and Contexts in Reversible Concurrent Calculus.

Clément Aubert, Doriana Medic

CoRR, 2021

Process, Systems and Tests: Three Layers in Concurrent Computation.

Clément Aubert, Daniele Varacca

Proceedings of the Proceedings 14th Interaction and Concurrency Experience, 2021

Explicit Identifiers and Contexts in Reversible Concurrent Calculus.

Clément Aubert, Doriana Medic

Proceedings of the Reversible Computation - 13th International Conference, 2021

2020

Structural Equivalences for Reversible Calculi of Communicating Systems (Oral communication).

Clément Aubert, Ioana Cristescu

CoRR, 2020

How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation.

Clément Aubert, Ioana Cristescu

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

Categories for Me, and You?

Clément Aubert

CoRR, 2019

2018

Unification and Logarithmic Space.

Clément Aubert, Marc Bagnol

Log. Methods Comput. Sci., 2018

History-Preserving Bisimulations on Reversible Calculus of Communicating Systems.

Clément Aubert, Ioana Cristescu

CoRR, 2018

2017

Contextual equivalences in configuration structures and reversibility.

Clément Aubert, Ioana Cristescu

J. Log. Algebraic Methods Program., 2017

2016

Characterizing co-NL by a group action.

Clément Aubert, Thomas Seiller

Math. Struct. Comput. Sci., 2016

Logarithmic space and permutations.

Clément Aubert, Thomas Seiller

Inf. Comput., 2016

Unary Resolution: Characterizing Ptime.

Clément Aubert, Marc Bagnol, Thomas Seiller

Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015

Reversible Barbed Congruence on Configuration Structures.

Clément Aubert, Ioana Cristescu

Proceedings of the Proceedings 8th Interaction and Concurrency Experience, 2015

Memoization for Unary Logic Programming: Characterizing PTIME.

Clément Aubert, Marc Bagnol, Thomas Seiller

CoRR, 2015

An in-between "implicit" and "explicit" complexity: Automata.

Clément Aubert

CoRR, 2015

2014

Logic Programming and Logarithmic Space.

Clément Aubert, Marc Bagnol, Paolo Pistone, Thomas Seiller

Proceedings of the Programming Languages and Systems - 12th Asian Symposium, 2014

2013

Linear Logic and Sub-polynomial Classes of Complexity. (Logique linéaire et classes de complexité sous-polynomiales).

Clément Aubert

PhD thesis, 2013

2011

Sublogarithmic uniform Boolean proof nets

Clément Aubert

Proceedings of the Proceedings Second Workshop on Developments in Implicit Computational Complexity, 2011