Skip to main content

6 Result(s)

within Bernadette Charron-Bost Remove this filter Logics and Meanings of Programs Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Transience Bounds for Distributed Algorithms

    A large variety of distributed systems, like some classical synchronizers, routers, or schedulers, have been shown to have a periodic behavior after an initial transient phase (Malka and Rajsbaum, WDAG 1991). ...

    Bernadette Charron-Bost, Matthias Függer… in Formal Modeling and Analysis of Timed Syst… (2013)

  2. No Access

    Chapter and Conference Paper

    A Reduction Theorem for the Verification of Round-Based Distributed Algorithms

    We consider the verification of algorithms expressed in the Heard-Of Model, a round-based computational model for fault-tolerant distributed computing. Rounds in this model are communication-closed, and we sho...

    Mouna Chaouch-Saad, Bernadette Charron-Bost, Stephan Merz in Reachability Problems (2009)

  3. No Access

    Chapter and Conference Paper

    Validity Conditions in Agreement Problems and Time Complexity

    We first introduce a new class of distributed agreement problems, ranging from Uniform Consensus to Non-Blocking Atomic Commitment, by varying the validity condition in the specification. We then provide an ea...

    Bernadette Charron-Bost, Fabrice Le Fessant in SOFSEM 2004: Theory and Practice of Comput… (2004)

  4. No Access

    Chapter and Conference Paper

    Revisiting Safety and Liveness in the Context of Failures

    Safety and liveness are two fundamental concepts for proving the correctness of concurrent programs. In the context of failures, however, we observe that some properties that are commonly believed to be safety...

    Bernadette Charron-Bost, Sam Toueg, Anindya Basu in CONCUR 2000 — Concurrency Theory (2000)

  5. No Access

    Chapter and Conference Paper

    Concerning the size of clocks

    By Fidge and Mattern's algorithm, it was already known that it is sufficient to use n-tuple as timestamps of events for a system distributed over n processes if causal independence is to be characterized. In this...

    Bernadette Charron-Bost in Semantics of Systems of Concurrent Processes (1990)

  6. No Access

    Chapter and Conference Paper

    Measure of parallelism of distributed computations

    We define a measure of parallelism of a distributed computation which evaluates the interactions between the processes in this computation. This measure assesses the structure of the exchanges of messages, rat...

    Bernadette Charron-Bost in STACS 89 (1989)