Add to ORKGWe illustrate a technique for proving properties of distributed programs. Our tech-nique avoids the notion of global time or global state. Furthermore, it does not require any use of temporal logic. All properties are proven using induction on the happened-before relation and its complement. We illustrate our technique by providing a formal proof of Lamport's algorithm for mutual exclusion.
The outcome of any computation is determined by the order of the events in the computation and the s...
An important problem in analyzing distributed computations is the amount of information. In event-ba...
Tracking causality should not be ignored. It is important in the design of many distributed algorith...
There are two approaches to reasoning about distributed algorithms. In the operational approach, one...
Proving properties of distributed algorithms is still a highly challenging problem and various appro...
Abstract: The paper shows that characterizing the causal relationship between significant events is ...
The paper shows that characterizing the causal relationship between significant events is an importa...
The aim of this paper to demonstrate rigorous reasoning in the context of concurrency. We present a ...
The behaviour of distributed systems is described in terms of typed branching-time logics. Dist...
We provide a logic for distributed computing that has the explanatory and technical power of constr...
The concept of causality between events is fundamental to the design and analysis of parallel and di...
Memory space and processor time are basic resources when executing a program. But beside this implem...
Temporal logic is widely acclaimed to be a highly successful tool for analyzing non-real-time proper...
Although a large number of formal methods have been reported in the literature, most of them are app...
A logic for reasoning about timing properties of concurrent programs is presented. The logic is ba...
The outcome of any computation is determined by the order of the events in the computation and the s...
An important problem in analyzing distributed computations is the amount of information. In event-ba...
Tracking causality should not be ignored. It is important in the design of many distributed algorith...
There are two approaches to reasoning about distributed algorithms. In the operational approach, one...
Proving properties of distributed algorithms is still a highly challenging problem and various appro...
Abstract: The paper shows that characterizing the causal relationship between significant events is ...
The paper shows that characterizing the causal relationship between significant events is an importa...
The aim of this paper to demonstrate rigorous reasoning in the context of concurrency. We present a ...
The behaviour of distributed systems is described in terms of typed branching-time logics. Dist...
We provide a logic for distributed computing that has the explanatory and technical power of constr...
The concept of causality between events is fundamental to the design and analysis of parallel and di...
Memory space and processor time are basic resources when executing a program. But beside this implem...
Temporal logic is widely acclaimed to be a highly successful tool for analyzing non-real-time proper...
Although a large number of formal methods have been reported in the literature, most of them are app...
A logic for reasoning about timing properties of concurrent programs is presented. The logic is ba...
The outcome of any computation is determined by the order of the events in the computation and the s...
An important problem in analyzing distributed computations is the amount of information. In event-ba...
Tracking causality should not be ignored. It is important in the design of many distributed algorith...