-
Fair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report)
We consider the problem of automatically verifying that a parameterized ...
read it
-
Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics
Verification of fault-tolerant distributed protocols is an immensely dif...
read it
-
Local Reasoning for Parameterized First Order Protocols
First Order Logic (FOL) is a powerful reasoning tool for program verific...
read it
-
Regular Model Checking Revisited (Technical Report)
In this contribution we revisit regular model checking, a powerful frame...
read it
-
Leveraging Textual Specifications for Grammar-based Fuzzing of Network Protocols
Grammar-based fuzzing is a technique used to find software vulnerabiliti...
read it
-
Verification and Synthesis of Symmetric Uni-Rings for Leads-To Properties
This paper investigates the verification and synthesis of parameterized ...
read it
-
Scalable Verification of Probabilistic Networks
This paper presents McNetKAT, a scalable tool for verifying probabilisti...
read it
Probabilistic Bisimulation for Parameterized Systems (Technical Report)
Probabilistic bisimulation is a fundamental notion of process equivalence for probabilistic systems. Among others, it has important applications including formalizing the anonymity property of several communication protocols. There is a lot of work on verifying probabilistic bisimulation for finite systems. This is however not the case for parameterized systems, where the problem is in general undecidable. In this paper we provide a generic framework for reasoning about probabilistic bisimulation for parameterized systems. Our approach is in the spirit of software verification, wherein we encode proof rules for probabilistic bisimulation and use a decidable first-order theory to specify systems and candidate bisimulation relations, which can then be checked automatically against the proof rules. As a case study, we show that our framework is sufficiently expressive for proving the anonymity property of the parameterized dining cryptographers protocol and the parameterized grades protocol, when supplied with a candidate regular bisimulation relation. Both of these protocols hitherto could not be verified by existing automatic methods. Moreover, with the help of standard automata learning algorithms, we show that the candidate relations can be synthesized fully automatically, making the verification fully automated.
READ FULL TEXT
Comments
There are no comments yet.