Clément Aubert

Available identifiers

zbMath Open aubert.clementDBLP62/10826WikidataQ102430670 ScholiaQ102430670MaRDI QIDQ276246

List of research outcomes

Publication	Date of Publication	Type
Processes, systems \& tests: defining contextual equivalences	2024-12-06	Paper
Diamonds for security: a non-interleaving operational semantics for the applied \(\pi\)-calculus	2024-08-13	Paper
The correctness of concurrencies in (reversible) concurrent calculi	2024-02-12	Paper
https://portal.mardi4nfdi.de/entity/Q6150427	2024-02-06	Paper
Replications in reversible concurrent calculi	2024-01-11	Paper
Implementation of a reversible distributed calculus	2024-01-11	Paper
Distributing and parallelizing non-canonical loops	2023-08-17	Paper
Concurrencies in reversible concurrent calculi	2022-11-11	Paper
Processes against tests: on defining contextual equivalences	2022-09-30	Paper
https://portal.mardi4nfdi.de/entity/Q5089270	2022-07-18	Paper
mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity	2022-03-08	Paper
Explicit Identifiers and Contexts in Reversible Concurrent Calculus	2021-11-03	Paper
An extended and more practical mwp flow analysis	2021-06-24	Paper
pymwp: A Tool for Guaranteeing Complexity Bounds for C Programs	2021-06-24	Paper
https://portal.mardi4nfdi.de/entity/Q5854675	2021-03-17	Paper
How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation	2020-05-14	Paper
Structural Equivalences for Reversible Calculi of Communicating Systems (Oral communication)	2020-05-14	Paper
https://portal.mardi4nfdi.de/entity/Q5216153	2020-02-14	Paper
Categories for Me, and You?	2019-10-11	Paper
https://portal.mardi4nfdi.de/entity/Q4580325	2018-08-15	Paper
Contextual equivalences in configuration structures and reversibility	2016-11-30	Paper
Characterizingco-NLby a group action	2016-07-28	Paper
Unary Resolution: Characterizing Ptime	2016-06-10	Paper
Logarithmic space and permutations	2016-05-03	Paper
Logic Programming and Logarithmic Space	2016-02-26	Paper
An in-between "implicit" and "explicit" complexity: Automata	2015-01-31	Paper
Memoization for Unary Logic Programming: Characterizing PTIME	2015-01-21	Paper
Unification and Logarithmic Space	2014-07-24	Paper

Research outcomes over time

This page was built for person: Clément Aubert