Message chains for distributed system verification
Verification of asynchronous distributed programs is challenging due to the need to reason
about numerous control paths resulting from the myriad interleaving of messages and …
about numerous control paths resulting from the myriad interleaving of messages and …
Parameterized verification of round-based distributed algorithms via extended threshold automata
Threshold automata are a computational model that has proven to be versatile in modeling
threshold-based distributed algorithms and enabling their completely automatic …
threshold-based distributed algorithms and enabling their completely automatic …
Quicksilver: modeling and parameterized verification for distributed agreement-based systems
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 …
agreement protocols such as consensus and leader election. Oddly, there have been far …
Learning Broadcast Protocols
The problem of learning a computational model from examples has been receiving growing
attention. For the particularly challenging problem of learning models of distributed systems …
attention. For the particularly challenging problem of learning models of distributed systems …
Synthesis of distributed agreement-based systems with efficiently-decidable verification
Distributed agreement-based (DAB) systems use common distributed agreement protocols
such as leader election and consensus as building blocks for their target functionality. While …
such as leader election and consensus as building blocks for their target functionality. While …
Enabling bounded verification of doubly-unbounded distributed agreement-based systems via bounded regions
The ubiquity of distributed agreement protocols, such as consensus, has galvanized interest
in verification of such protocols as well as applications built on top of them. The complexity …
in verification of such protocols as well as applications built on top of them. The complexity …
Parameterized Verification of Systems with Precise (0, 1)-Counter Abstraction
We introduce a new framework for verifying systems with a parametric number of
concurrently running processes. The systems we consider are well-structured with respect to …
concurrently running processes. The systems we consider are well-structured with respect to …
[PDF][PDF] Automating Cutoff-based Verification of Distributed Protocols
Distributed protocols are generally parametric and are expected to work correctly on
systems containing any number of nodes. Therefore, proving their correctness becomes an …
systems containing any number of nodes. Therefore, proving their correctness becomes an …
Formal Methods: 26th International Symposium, FM 2024, Milan, Italy, September 9–13, 2024, Proceedings, Part I
The open access book set LNCS 14933+ 14934 constitutes the refereed proceedings of the
26th International Symposium on Formal Methods, FM 2024, which took place in Milan, Italy …
26th International Symposium on Formal Methods, FM 2024, which took place in Milan, Italy …
Automatic WSTS-based Repair and Deadlock Detection of Parameterized Systems
We present an algorithm for the repair of parameterized systems that can be represented as
well-structured transition systems. The repair problem is, for a given process …
well-structured transition systems. The repair problem is, for a given process …