Synthesis of Distributed Agreement-Based Systems with Efficiently-Decidable Verification (Extended Version)

Jaber, Nouraldin; Wagner, Christopher; Jacobs, Swen; Kulkarni, Milind; Samanta, Roopsha

doi:10.48550/arxiv.2208.12400

Cited by 1 publication

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The benchmarks we use are process sketches based on the benchmarks presented in [17]. We refer the reader to the extended version [19] for (i) a description of each benchmark's functionality, its safety and liveness specifications, and the unspecified functionality in the sketch, and (ii) an example Mercury sketch and its completion. Experimental Setup.…”

Section: Discussionmentioning

confidence: 99%

“…Liveness properties φ l (c) ensure that the system makes progress and eventually reacts to various events. We refer the interested reader to the extended version [19] for details on specifying liveness properties as well as extracting and encoding counterexamples to such properties.…”

Section: Methodsmentioning

confidence: 99%

“…In this work, we carefully analyzed the phase-compatibility and cutoff amenability conditions and incorporated procedures to compute witnesses for their literals (i.e., the witness calls on Line 8). We refer the interested reader to the extended version [19] of this paper for complete details, and illustrate one such counterexample extraction procedure using an example. Example.…”

Section: Counterexample Extractionmentioning

confidence: 99%

See 2 more Smart Citations

Synthesis of Distributed Agreement-Based Systems with Efficiently-Decidable Verification

Jaber

Wagner

Jacobs

et al. 2023

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Distributed agreement-based (DAB) systems use common distributed agreement protocols such as leader election and consensus as building blocks for their target functionality. While automated verification for DAB systems is undecidable in general, recent work identifies a large class of DAB systems for which verification is efficiently-decidable. Unfortunately, the conditions characterizing such a class can be opaque and non-intuitive, and can pose a significant challenge to system designers trying to model their systems in this class.In this paper, we present a synthesis-driven tool, Cinnabar, to help system designers building DAB systems ensure that their intended designs belong to an efficiently-decidable class. In particular, starting from an initial sketch provided by the designer, Cinnabar generates sketch completions using a counterexample-guided procedure. The core technique relies on compactly encoding root-causes of counterexamples to varied properties such as efficient-decidability and safety. We demonstrate Cinnabar ’s effectiveness by successfully and efficiently synthesizing completions for a variety of interesting DAB systems including a distributed key-value store and a distributed consortium system.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Methodsmentioning

confidence: 99%

Section: Counterexample Extractionmentioning

confidence: 99%

See 1 more Smart Citation