Zobrazeno 1 - 10
of 105
pro vyhledávání: '"Ulidowski, Irek"'
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 past synchronisations thanks to communication keys, thus easing the st
Externí odkaz:
http://arxiv.org/abs/2410.14699
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 execution in parallel discrete event simulation. A number of approach
Externí odkaz:
http://arxiv.org/abs/2307.13360
Autor:
Hoey, James, Ulidowski, Irek
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 performs forward execution and saves information necessary for reversal. T
Externí odkaz:
http://arxiv.org/abs/2205.01171
Autor:
Zhu, Hengde, Wang, Wei, Ulidowski, Irek, Zhou, Qinghua, Wang, Shuihua, Chen, Huafeng, Zhang, Yudong
Publikováno v:
In Knowledge-Based Systems 25 November 2023 280
Autor:
Melgratti, Hernán, Mezzina, Claudio Antares, Phillips, Iain, Pinna, G. Michele, Ulidowski, Irek
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 structure, and vice versa. More generally, the relationships between va
Externí odkaz:
http://arxiv.org/abs/1910.10987
Publikováno v:
Logical Methods in Computer Science, Volume 16, Issue 4 (October 16, 2020) lmcs:5831
Petri nets are a well-known model of concurrency and provide an ideal setting for the study of fundamental aspects in concurrent systems. Despite their simplicity, they still lack a satisfactory causally reversible semantics. We develop such semantic
Externí odkaz:
http://arxiv.org/abs/1910.04266
Publikováno v:
EPTCS 276, 2018, pp. 69-86
We show how to reverse a while language extended with blocks, local variables, procedures and the interleaving parallel composition. Annotation is defined along with a set of operational semantics capable of storing necessary reversal information, an
Externí odkaz:
http://arxiv.org/abs/1808.08651
Publikováno v:
EPTCS 255, 2017, pp. 51-66
We propose an approach and a subsequent extension for reversing imperative programs. Firstly, we produce both an augmented version and a corresponding inverted version of the original program. Augmentation saves reversal information into an auxiliary
Externí odkaz:
http://arxiv.org/abs/1709.00828
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Phillips, Iain, Ulidowski, Irek
Publikováno v:
EPTCS 64, 2011, pp. 104-118
We introduce event identifier logic (EIL) which extends Hennessy-Milner logic by the addition of (1) reverse as well as forward modalities, and (2) identifiers to keep track of events. We show that this logic corresponds to hereditary history-preserv
Externí odkaz:
http://arxiv.org/abs/1108.4470