Synthesis of distributed agreement-based systems with efficiently-decidable verification

DOI10.1007/978-3-031-30820-8_19MaRDI QIDQ6536135zbMATH OpenFDO

Authors Nouraldin Jaber, Christopher L. Wagner, Swen Jacobs, M. N. Kulkarni, Roopsha Samanta

Publication date 5 April 2024

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-30820-8_19

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Distributed synthesis for acyclic architectures
• SEMI-AUTOMATIC DISTRIBUTED SYNTHESIS
• Automated Technology for Verification and Analysis
• scientific article; zbMATH DE number 7455739

Cites work

• A logic-based framework for verifying consensus algorithms
• A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
• Controlling a population
• Dafny: an automatic program verifier for functional correctness
• Decidability of parameterized verification
• Deciding effectively propositional logic using DPLL and substitution sets
• Learning regular sets from queries and counterexamples
• Parameterized Synthesis
• Parameterized synthesis of self-stabilizing protocols in symmetric networks
• Parameterized synthesis with safety properties
• Parameterized verification of systems with global synchronization and guards
• Proving properties of a ring of finite-state machines
• Synthesis of distributed algorithms with parameterized threshold guards
• The Heard-Of model: computing in distributed systems with benign faults

This page was built for publication: Synthesis of distributed agreement-based systems with efficiently-decidable verification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536135)