Parameterized Synthesis with Safety Properties

Markgraf, Oliver; Hong, Chih-Duo; Lin, Anthony W.; Najib, Muhammad Sharfi; Neider, Daniel

doi:10.1007/978-3-030-64437-6_14

Cited by 6 publications

(3 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The synthesis goal is to synthesize a controller that controls all agents uniformly and guides them to a specific desired state. Markgraf et al [27] also target synthesis of controllers by posing the problem as an infinite-duration 2-player game and utilize regular model checking and the L* algorithm [4] to learn correct-by-design controllers. These approaches are not applicable to our setup as they do not admit distributed agreement-based systems (modeled in Mercury).…”

Section: Related Workmentioning

confidence: 99%

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

Jaber

Wagner

Jacobs

et al. 2023

Lecture Notes in Computer Science

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: Related Workmentioning

confidence: 99%

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

Jaber

Wagner

Jacobs

et al. 2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Angluin's well-known notion of exact learning [2,3] can be captured by an interaction with the so-called minimally adequate teachers, which can answer membership and equivalence queries. This has many applications in verification, e.g., verification of parameterized systems [10,20,23] and compositional verification [9]. Another learning framework that has become very popular in verification is CEGIS (Counterexample Guided Inductive Synthesis) [21,27], wherein a learning algorithm can ask equivalence queries, but expect various types of "constraint-like" counterexamples (e.g.…”

Section: Introductionmentioning

confidence: 99%

Learning Union of Integer Hypercubes with Queries

Markgraf

Lin

Stan

2021

Computer Aided Verification

Self Cite

View full text Add to dashboard Cite

We study the problem of learning a finite union of integer (axis-aligned) hypercubes over the d-dimensional integer lattice, i.e., whose edges are parallel to the coordinate axes. This is a natural generalization of the classic problem in the computational learning theory of learning rectangles. We provide a learning algorithm with access to a minimally adequate teacher (i.e. membership and equivalence oracles) that solves this problem in polynomial-time, for any fixed dimension d. Over a non-fixed dimension, the problem subsumes the problem of learning DNF boolean formulas, a central open problem in the field. We have also provided extensions to handle infinite hypercubes in the union, as well as showing how subset queries could improve the performance of the learning algorithm in practice. Our problem has a natural application to the problem of monadic decomposition of quantifier-free integer linear arithmetic formulas, which has been actively studied in recent years. In particular, a finite union of integer hypercubes correspond to a finite disjunction of monadic predicates over integer linear arithmetic (without modulo constraints). Our experiments suggest that our learning algorithms substantially outperform the existing algorithms.

show abstract

“…Angluin's well-known notion of exact learning [2,3] can be captured by an interaction with the so-called minimally adequate teachers, which can answer membership and equivalence queries. This has many applications in verification, e.g., verification of parameterized systems [10,20,23] and compositional verification [9]. Another learning framework that has become very popular in verification is CEGIS (Counterexample Guided Inductive Synthesis) [26,21], wherein a learning algorithm can ask equivalence queries, but expect various types of "constraint-like" counterexamples (e.g.…”

Section: Introductionmentioning

confidence: 99%

Learning Union of Integer Hypercubes with Queries (Technical Report)

Markgraf¹,

Stan²,

Lin³

2021

Preprint

Self Cite

View full text Add to dashboard Cite

We study the problem of learning a finite union of integer (axis-aligned) hypercubes over the d-dimensional integer lattice, i.e., whose edges are parallel to the coordinate axes. This is a natural generalization of the classic problem in the computational learning theory of learning rectangles. We provide a learning algorithm with access to a minimally adequate teacher (i.e. membership and equivalence oracles) that solves this problem in polynomial-time, for any fixed dimension d. Over a non-fixed dimension, the problem subsumes the problem of learning DNF boolean formulas, a central open problem in the field. We have also provided extensions to handle infinite hypercubes in the union, as well as showing how subset queries could improve the performance of the learning algorithm in practice. Our problem has a natural application to the problem of monadic decomposition of quantifier-free integer linear arithmetic formulas, which has been actively studied in recent years. In particular, a finite union of integer hypercubes correspond to a finite disjunction of monadic predicates over integer linear arithmetic (without modulos constraints). Our experiments suggest that our learning algorithms substantially outperform the existing algorithms.

show abstract

Parameterized Synthesis with Safety Properties

Cited by 6 publications

References 40 publications

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

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

Learning Union of Integer Hypercubes with Queries

Learning Union of Integer Hypercubes with Queries (Technical Report)

Contact Info

Product

Resources

About