A cut-off approach for bounded verification of parameterized systems

@article{Yang2010ACA,
  title={A cut-off approach for bounded verification of parameterized systems},
  author={Qiusong Yang and Mingshu Li},
  journal={2010 ACM/IEEE 32nd International Conference on Software Engineering},
  year={2010},
  volume={1},
  pages={345-354}
}
  • Qiusong Yang, Mingshu Li
  • Published 1 May 2010
  • Computer Science
  • 2010 ACM/IEEE 32nd International Conference on Software Engineering
The features in multi-threaded programs, such as recursion, dynamic creation and communication, pose a great challenge to formal verification. A widely adopted strategy is to verify tentatively a system with a smaller size, by limiting the depth of recursion or the number of replicated processes, to find errors without ensuring the full correctness. The model checking of parameterized systems, a parametric infinite family of systems, is to decide if a property holds in every size instance… 

Figures and Tables from this paper

Dynamic Cut-Off Algorithm for Parameterised Refinement Checking
TLDR
This work converts the multi-parameterised verification of safety properties by refinement checking in the context of labelled transition systems (LTSs) into the unsatisfiability of a first-order formula and provides a SAT modulo theories (SMT)-based semi-algorithm for dynamically, i.e., iteratively, computing the cut-offs.
Attacking the Dimensionality Problem of Parameterized Systems via Bounded Reachability Graphs
TLDR
This work has developed an approach for building abstractions with incrementally increased dimensions and thus improving the precision until a property is proven or a counterexample is detected, based on bounded backward reachability graphs, a novel abstraction for parameterized systems.
Parameterized Model-Checking of Timed Systems with Conjunctive Guards
TLDR
The Emerson and Kahlon's cutoff theorems for process skeletons with conjunctive guards are extended to Parameterized Networks of Timed Automata to give a tool to universally verify software systems where an unknown number of software components interact with continuous time temporal constraints.
Bounds2: A Tool for Compositional Multi-parametrised Verification
TLDR
Bounds2 provides a sound and complete approach to parametrised verification under explicit assumptions checked automatically by the tool, which lends support to compositional reasoning through three refinement-based notions of correctness.
Golok: Push-button Verification of Parameterized Systems
TLDR
This work presents a generic framework for representing pa- rameterized systems and identifies a fragment of CML for which the satisfiability problem is decidable, and presents an implementation of the technique to prove its applicability.
Refinement Checking Parameterised Quorum Systems
  • Antti Siirtola
  • Computer Science
    2017 17th International Conference on Application of Concurrency to System Design (ACSD)
  • 2017
TLDR
A generic compositional formalism is introduced, based on parameterised labelled transition systems, which allows to express safety properties of parameterised quorum systems and proves that any parameterised verification task expressible in the formalism collapses into finitely many finite state refinement checking problems.
Parametrised Interface Automata
  • Antti Siirtola
  • Computer Science
    2014 14th International Conference on Application of Concurrency to System Design
  • 2014
TLDR
This work presents, at least to their knowledge, the first IT which allows to specify the parametric number of parametrised interfaces, and provides a fully algorithmic procedure for checking the compatibility of and refinement between parametrising IAs.
...
1
2
...

References

SHOWING 1-10 OF 25 REFERENCES
Reducing Model Checking of the Many to the Few
TLDR
Decidability of PMCP is established as it is only necessary to model check a finite number of relatively small systems, and efficient decidability can be obtained in some cases.
Limits for Automatic Verification of Finite-State Concurrent Systems
On model checking for non-deterministic infinite-state systems
  • E. Emerson, K. Namjoshi
  • Computer Science, Mathematics
    Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226)
  • 1998
TLDR
It is demonstrated that many known algorithms for model checking infinite-state systems can be derived uniformly from a reachability procedure that generates a "covering graph", a generalization of the Karp-Miller graph for Petri Nets, indicating that the covering graph construction is appropriate for the analysis of infinite state systems.
Verifying Properties of Large Sets of Processes with Network Invariants
TLDR
In very general terms, the approach is to find ways of proving that if a process satisfies a formula, then the n-fold parallel composition of this process with itself still satisfies the same (or a related) formula.
Constraint-Based Model Checking for Parameterized Synchronous Systems
TLDR
This work presents a fully-automatic method for checking safety properties of parameterized synchronous systems based on a backward reachability procedure working over real arithmetics, using a special class of linear arithmetic constraints to represent collections of global system states.
Avoiding the state explosion problem in temporal logic model checking
TLDR
A linear algorithm that determines whether the global state transition graph associated with some concurrent program satisfies a formula in the temporal logic CTL and has been used successfully to find errors in network protocols and asynchronous circuits designs.
A structural induction theorem for processes
TLDR
An induction method is presented that allows us to infer properties of systems of unbounded size, but constructed by a uniform rule, from properties automatically verified on a system of fixed (and, presumably, small) size.
Verification of parametric concurrent systems with prioritised FIFO resource management
TLDR
This work considers the problem of parametric verification over a class of systems of processes competing for access to shared resources and establishes several decidability results for different classes of the considered properties and systems.
Reasoning about systems with many processes
TLDR
Methods are given for automatically verifying temporal properties of concurrent systems containing an arbitrary number of finite-state processes that communicate using CCS actions and how these decision procedures can be used to reason about certain systems with a communication network.
Automatic Verification of Parameterized Synchronous Systems (Extended Abstract)
TLDR
This work considers systems formed by a synchronous parallel composition of a single control process with an arbitrary number of homogeneous user processes, and shows that the Parameterized Model Checking Problem is decidable for properties expressed in an indexed propositional temporal logic.
...
1
2
3
...