3 citations · 9 across the 10 of their papers we have counts for
6 papers · 1 filter
Bisimulations Respecting Duration and Causality for the Non-interleaving Applied -Calculus
Clément Aubert, Ross Horne, Christian Johansen
This paper shows how we can make use of an asynchronous transition system, whose transitions are labelled with events and which is equipped with a notion of independence of events,…
An extended and more practical mwp flow analysis
Clément Aubert, Thomas Rubiano, Neea Rusch +1
We improve and refine a method for certifying that the values' sizes computed by an imperative program will be bounded by polynomials in the program's inputs' sizes. Our work ''tam…
Enabling Replications and Contexts in Reversible Concurrent Calculus
Clément Aubert, Doriana Medić
Existing formalisms for the algebraic specification and representation of networks of reversible agents suffer some shortcomings. Despite multiple attempts, reversible declensions…
History-Preserving Bisimulations on Reversible Calculus of Communicating Systems
Clément Aubert, Ioana Cristescu
History-and hereditary history-preserving bisimulation (HPB and HHPB) are equivalences relations for denotational models of concurrency. Finding their counterpart in process algebr…
An in-between "implicit" and "explicit" complexity: Automata
Clément Aubert
Implicit Computational Complexity makes two aspects implicit, by manipulating programming languages rather than models of com-putation, and by internalizing the bounds rather than…
Memoization for Unary Logic Programming: Characterizing PTIME
Clément Aubert, Marc Bagnol, Thomas Seiller
We give a characterization of deterministic polynomial time computation based on an algebraic structure called the resolution semiring, whose elements can be understood as logic pr…