Parameterized Verification of Systems with Global Synchronization and Guards

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

doi:10.1007/978-3-030-53288-8_15

Cited by 9 publications

(21 citation statements)

References 54 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Global Synchronization Protocols (GSPs). In recent work, Jaber et al [2020a] propose a new model, GSP, for crash-and failure-free distributed systems and present decidability and cutoff results for parameterized verification of systems in the model. This model supports global transitions associated with global guards which can be used by multiple processes to synchronize collectively and simultaneously.…”

Section: The Quicksilver Frameworkmentioning

confidence: 99%

“…Model Checking. Prior work on PMCP identifies decidable fragments based on restrictions on the communication primitives, specifications, and structure of the system [Aminof et al 2018;Außerlechner et al 2016;Delzanno et al 2002;Emerson and Kahlon 2003b;Esparza et al 1999;German and Sistla 1992;Jaber et al 2020a]. To enable efficient parameterized verification, prior work additionally identifies cutoff results for various classes of systems, e.g., cache coherence protocols [Emerson and Kahlon 2003a], guarded protocols [Jacobs and Sakr 2018], consensus protocols [Marić et al 2017], and self-stabilizing systems [Bloem et al 2016].…”

Section: The Quicksilver Frameworkmentioning

confidence: 99%

“…To enable efficient parameterized verification, prior work additionally identifies cutoff results for various classes of systems, e.g., cache coherence protocols [Emerson and Kahlon 2003a], guarded protocols [Jacobs and Sakr 2018], consensus protocols [Marić et al 2017], and self-stabilizing systems [Bloem et al 2016]. Unfortunately, no existing decidability and cutoff results, except for those in [Jaber et al 2020a], extend to agreement-based systems.…”

Section: The Quicksilver Frameworkmentioning

confidence: 99%

“…Proof Intuition. The proof leverages a new fragment of an existing abstract model, the GSP model [Jaber et al 2020a], for which MPVP is decidable. The decidability result for the GSP model utilizes the framework of well-structured transition systems (WSTSs).…”

Section: :21mentioning

confidence: 99%

See 3 more Smart Citations

QuickSilver: modeling and parameterized verification for distributed agreement-based systems

Jaber

Wagner

Jacobs

et al. 2021

Proc. ACM Program. Lang.

Self Cite

View full text Add to dashboard Cite

The last decade has sparked several valiant efforts in deductive verification of distributed agreement protocols such as consensus and leader election. Oddly, there have been far fewer verification efforts that go beyond the core protocols and target applications that are built on top of agreement protocols. This is unfortunate, as agreement-based distributed services such as data stores, locks, and ledgers are ubiquitous and potentially permit modular, scalable verification approaches that mimic their modular design. We address this need for verification of distributed agreement-based systems through our novel modeling and verification framework, QuickSilver, that is not only modular, but also fully automated. The key enabling feature of QuickSilver is our encoding of abstractions of verified agreement protocols that facilitates modular, decidable, and scalable automated verification. We demonstrate the potential of QuickSilver by modeling and efficiently verifying a series of tricky case studies, adapted from real-world applications, such as a data store, a lock service, a surveillance system, a pathfinding algorithm for mobile robots, and more.

show abstract

Section: The Quicksilver Frameworkmentioning

confidence: 99%

Section: The Quicksilver Frameworkmentioning

confidence: 99%

Section: The Quicksilver Frameworkmentioning

confidence: 99%

Section: :21mentioning

confidence: 99%

See 2 more Smart Citations

QuickSilver: modeling and parameterized verification for distributed agreement-based systems

Jaber

Wagner

Jacobs

et al. 2021

Proc. ACM Program. Lang.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Beyond Disjunctive Systems. Furthermore, we have extended Algorithm 2 to other systems that can be framed as WSTS, in particular rendezvous systems [33] and systems based on broadcasts or other global synchronizations [24,35]. All of these are known to be WSTS, and there are two remaining challenges:…”

Section: Extensionsmentioning

confidence: 99%

Automatic Repair and Deadlock Detection for Parameterized Systems

Jacobs¹,

Sakr²,

Völp³

2021

Preprint

Self Cite

View full text Add to dashboard Cite

We present an algorithm for the repair of parameterized systems. The repair problem is, for a given process implementation, to find a refinement such that a given property is satisfied by the resulting parameterized system, and deadlocks are avoided. Our algorithm employs a constraint-based search for candidate repairs, and uses a parameterized model checker to determine their correctness and update the constraint system in case errors are reachable. We apply this algorithm on systems that can be represented as well-structured transition systems (WSTS), including disjunctive systems, pairwise rendezvous systems, and broadcast protocols. Moreover, we show that parameterized deadlock detection can be decided in NEXPTIME for disjunctive systems, vastly improving on the best known lower bound, and that it is in general undecidable for broadcast protocols.Contributions. Our main contribution is a counterexample-guided parameterized repair approach, based on model checking of well-structured transition systems (WSTS) [1,30]. We investigate which information a parameterized model checker needs to provide to guide the search for candidate repairs, and how this information can be encoded into propositional constraints. Moreover, we investigate how to systematically avoid deadlocks in the repaired system. Our repair algorithm supports many classes of systems, including guarded protocols with disjunctive guards [20], rendezvous systems [33] and broadcast protocols [24].Since existing model checking algorithms for WSTS do not support deadlock detection, our approach has a subprocedure to solve this problem, which relies on new theoretical results: for disjunctive systems, we provide a novel deadlock detection algorithm that vastly improves on the complexity of the best known solution, while for broadcast protocols we prove that deadlock detection is in general undecidable, so approximate methods have to be used. We evaluate an implementation of our algorithm on benchmarks from different application domains, including a distributed lock service and a robot-flocking protocol.This paper is organized as follows. In Sect. 2 we present our basic system model for disjunctive systems. In Sect. 3 we define the parameterized repair problem, propose a solution, and highlight three research challenges. In Sect. 4 we develop algorithms for parameterized model checking and deadlock detection that provide information on error paths for our repair approach. In Sect. 5 we introduce our parameterized repair algorithm, and in Sect. 6 we extend it to more general properties and systems. We provide our experimental evaluation in Sect. 7, followed by a discussion of related work in Sect. 8, and our conclusion and discussion of future work in Sect. 9. System ModelIn the following, let Q be a finite set of states.Processes. A process template is a transition system U = (Q U , init U , G U , δ U ), where Q U ⊆ Q is a finite set of states including the initial state init U , G U ⊆ P(Q) is a set of guards, and δ U :We denote by t U a transition of U ,...

show abstract

Parameterized Verification of Systems with Global Synchronization and Guards

Jaber

Jacobs

Wagner

et al. 2020

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Inspired by distributed applications that use consensus or other agreement protocols for global coordination, we define a new computational model for parameterized systems that is based on a general global synchronization primitive and allows for global transition guards. Our model generalizes many existing models in the literature, including broadcast protocols and guarded protocols. We show that reachability properties are decidable for systems without guards, and give sufficient conditions under which they remain decidable in the presence of guards. Furthermore, we investigate cutoffs for reachability properties and provide sufficient conditions for small cutoffs in a number of cases that are inspired by our target applications.

show abstract

Parameterized Verification of Systems with Global Synchronization and Guards

Cited by 9 publications

References 54 publications

QuickSilver: modeling and parameterized verification for distributed agreement-based systems

QuickSilver: modeling and parameterized verification for distributed agreement-based systems

Automatic Repair and Deadlock Detection for Parameterized Systems

Parameterized Verification of Systems with Global Synchronization and Guards

Contact Info

Product

Resources

About