Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Lozes, Etienne"'
Communicating finite-state machines (CFMs) are a Turing powerful model of asynchronous message-passing distributed systems. In weakly synchronous systems, processes communicate through phases in which messages are first sent and then received, for ea
Externí odkaz:
http://arxiv.org/abs/2308.10578
There is a wide variety of message-passing communication models, ranging from synchronous ''rendez-vous'' communications to fully asynchronous/out-of-order communications. For large-scale distributed systems, the communication model is determined by
Externí odkaz:
http://arxiv.org/abs/2210.13062
Publikováno v:
EPTCS 347, 2021, pp. 22-37
FIFO automata are finite state machines communicating through FIFO queues. They can be used for instance to model distributed protocols. Due to the unboundedness of the FIFO queues, several verification problems are undecidable for these systems. In
Externí odkaz:
http://arxiv.org/abs/2110.00145
A communicating system is $k$-synchronizable if all of the message sequence charts representing the executions can be divided into slices of $k$ sends followed by $k$ receptions. It was previously shown that, for a fixed given $k$, one could decide w
Externí odkaz:
http://arxiv.org/abs/2104.14408
Publikováno v:
Logical Methods in Computer Science, Volume 17, Issue 3 (August 10, 2021) lmcs:6548
We present the first complete axiomatisation for quantifier-free separation logic. The logic is equipped with the standard concrete heaplet semantics and the proof system has no external feature such as nominals/labels. It is not possible to rely com
Externí odkaz:
http://arxiv.org/abs/2006.05156
We present a general approach to axiomatise separation logics with heaplet semantics with no external features such as nominals/labels. To start with, we design the first (internal) Hilbert-style axiomatisation for the quantifier-free separation logi
Externí odkaz:
http://arxiv.org/abs/1910.05016
In this paper, we work on the notion of k-synchronizability: a system is k-synchronizable if any of its executions, up to reordering causally independent actions, can be divided into a succession of k-bounded interaction phases. We show two results (
Externí odkaz:
http://arxiv.org/abs/1909.01627
Publikováno v:
In Journal of Logical and Algebraic Methods in Programming February 2023 131
The list segment predicate ls used in separation logic for verifying programs with pointers is well-suited to express properties on singly-linked lists. We study the effects of adding ls to the full quantifier-free separation logic with the separatin
Externí odkaz:
http://arxiv.org/abs/1810.05410
Autor:
Finkel, Alain, Lozes, Etienne
Publikováno v:
Logical Methods in Computer Science, Volume 19, Issue 4 (December 20, 2023) lmcs:4764
A system of communicating finite state machines is synchronizable if its send trace semantics, i.e.the set of sequences of sendings it can perform, is the same when its communications are FIFO asynchronous and when they are just rendez-vous synchroni
Externí odkaz:
http://arxiv.org/abs/1702.07213