Regular Model Checking Revisited (Technical Report)

05/03/2020
by   Anthony W. Lin, et al.
0

In this contribution we revisit regular model checking, a powerful framework that has been successfully applied for the verification of infinite-state systems, especially parameterized systems (concurrent systems with an arbitrary number of processes). We provide a reformulation of regular model checking with length-preserving transducers in terms of existential second-order theory over automatic structures. We argue that this is a natural formulation that enables us tap into powerful synthesis techniques that have been extensively studied in the software verification community. More precisely, in this formulation the first-order part represents the verification conditions for the desired correctness property (for which we have complete solvers), whereas the existentially quantified second-order variables represent the relations to be synthesized. We show that many interesting correctness properties can be formulated in this way, examples being safety, liveness, bisimilarity, and games. More importantly, we show that this new formulation allows new interesting benchmarks (and old regular model checking benchmarks that were previously believed to be difficult), especially in the domain of parameterized system verification, to be solved.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/30/2017

Fair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report)

We consider the problem of automatically verifying that a parameterized ...
research
10/20/2019

MSO-Definable Regular Model Checking

Regular Model Checking (RMC) is a symbolic model checking technique wher...
research
05/18/2022

Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification

Automatic structures are infinite structures that are finitely represent...
research
07/10/2023

Model-checking parametric lock-sharing systems against regular constraints

In parametric lock-sharing systems processes can spawn new processes to ...
research
09/21/2017

Learning to Prove Safety over Parameterised Concurrent Systems (Full Version)

We revisit the classic problem of proving safety over parameterised conc...
research
02/08/2021

Regular Model Checking Approach to Knowledge Reasoning over Parameterized Systems (technical report)

We present a general framework for modelling and verifying epistemic pro...
research
02/27/2014

Synthesis of Parametric Programs using Genetic Programming and Model Checking

Formal methods apply algorithms based on mathematical principles to enha...

Please sign up or login with your details

Forgot password? Click here to reset