Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker (Q5883751): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The correctness proof of Ben-Or's randomized consensus algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness of verifying message passing programs under bounded asynchrony / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4778617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Parameterized Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reduction theorem for randomized distributed algorithms under weak adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous byzantine agreement protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronous consensus under hybrid process and link failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous consensus and broadcast protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Heard-Of model: computing in distributed systems with benign faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reduction Theorem for the Verification of Round-Based Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for <i>k</i> -set agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unreliable failure detectors for reliable distributed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimal synchronism needed for distributed consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Logic-Based Framework for Verifying Consensus Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSync: a partially synchronous language for fault-tolerant distributed algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4995365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of distributed programs into communication-closed layers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of model checking for infinite-state concurrent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Verifying Fault Tolerance of Distributed Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility of distributed consensus with one faulty process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disk Paxos / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-blocking atomic commit in asynchronous distributed systems with failure detectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting Symbolic Transitions from TLA$$^{+}$$+ Specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability in Parameterized Systems: All Flavors of Threshold Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability / rank
 
Normal rank
Property / cites work
 
Property / cites work: SMT and POR beat counter abstraction: parameterized model checking of threshold-based distributed algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness of bounded model checking for threshold-based distributed algorithms: reachability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time, clocks, and the ordering of events in a distributed system / rank
 
Normal rank
Property / cites work
 
Property / cites work: The part-time parliament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Byzantizing Paxos by Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chapar: certified causally consistent distributed key-value stores / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dafny: An Automatic Program Verifier for Functional Correctness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of distributed algorithms with parameterized threshold guards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutoff bounds for consensus algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle/HOL. A proof assistant for higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching Agreement in the Presence of Faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eliminating message counters in synchronous threshold automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving properties of a ring of finite-state machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bosco: One-Step Byzantine Asynchronous Consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of consensus algorithms using satisfiability solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: HotStuff / rank
 
Normal rank

Latest revision as of 18:20, 31 July 2024

scientific article; zbMATH DE number 7667095
Language Label Description Also known as
English
Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
scientific article; zbMATH DE number 7667095

    Statements

    Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker (English)
    0 references
    22 March 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers