24 citations · 61 across the 10 of their papers we have counts for
11 papers
Concurrency, Causality and Conflict via Independence in Reversible Calculi
Clément Aubert, Gabriele Cecilia, Iain C. C. Phillips +1
Among the different ways of approaching the semantics of process calculi, true-concurrency models stand out for their ability to highlight subtle interplays between events. At thei…
On the Encodability of Reversible Process Calculi
Ivan Lanese, Claudio Antares Mezzina, Iain Phillips +2
Reversibility, allowing one to execute a program not only forwards as usual, but also backwards, has emerged as a fundamental concept in computing, with applications ranging from d…
Dependence and Independence for Reversible Process Calculi
Clément Aubert, Iain Phillips, Irek Ulidowski
To refine formal methods for concurrent systems, there are several ways of enriching classical operational semantics of process calculi. One can enable the auditing and undoing of…
An Axiomatic Theory for Reversible Computation
Ivan Lanese, Iain Phillips, Irek Ulidowski
Undoing computations of a concurrent system is beneficial in many situations, e.g., in reversible debugging of multi-threaded programs and in recovery from errors due to optimistic…
Reversing an Imperative Concurrent Programming Language
James Hoey, Irek Ulidowski
We introduce a method of reversing the execution of imperative concurrent programs. Given an irreversible program, we describe the process of producing two versions. The first perf…
Reversible Causal Nets and Reversible Event Structures
Hernán Melgratti, Claudio Antares Mezzina, Iain Phillips +2
One of the well-known results in concurrency theory concerns the relationship between event structures and occurrence nets: an occurrence net can be associated with a prime event s…