Parameterized Compositional Model Checking

  title={Parameterized Compositional Model Checking},
  author={Kedar S. Namjoshi and Richard J. Trefler},
The Parameterized Compositional Model Checking Problem PCMCP is to decide, using compositional proofs, whether a property holds for every instance of a parameterized family of process networks. Compositional analysis focuses attention on the neighborhood structure of processes in the network family. For the verification of safety properties, the PCMCP is shown to be much more tractable than the more general Parameterized Model Checking Problem PMCP. For example, the PMCP is undecidable for ring… 

Symmetry Reduction and Compositional Verification on Timed Automata

A technique that incorporates automatic symmetry detection and symmetry reduction in the analysis of systems modeled by timed automata is described, and it is shown that verification is decidable in time polynomial in the state space of the cut-off instance.

Verifying Mutable Systems

This work gives a formulation of dynamic model checking which extends traditional model checking by allowing structural changes, mutations, to the topology of multi-process network models, and relates dynamic models to compositional reasoning, dynamic cutoffs, parametrized analysis, and previously established parametric assertions.

Parameterized verification under TSO is PSPACE-complete

It is proved that the complexity of a system consisting of an arbitrary number of identical processes is PSPACE-complete and the complexity is reduced to polynomial time if the processes are not allowed to read the initial values of the variables in the memory.

Symmetry Reduction for the Local Mu-Calculus

This work considers the verification of local properties, those defined over the neighborhood of a process, and it is shown that all local mu-calculus properties, including safety and liveness properties, are preserved by neighborhood symmetries.

Study of Parameterized-Chain networks

This paper develops a dependency graph for analysis of Parameterized-Chain Networks (PCN) and shows that partial and total deadlocks of the proposed PCN are characterized by full, consistent subgraphs of the dependency graph.

Local Reasoning for Parameterized First Order Protocols

This work presents a framework based on FOL for specifying distributed multi-process protocols in a process-local manner together with an implicit network topology, and uses an oracle for the topology to develop a sound and relatively complete proof rule that reduces reasoning about the implicit topology back to pure FOL.

Compositional Verification of Smart Contracts Through Communication Abstraction (Extended)

This paper presents local bundles that reduce contracts with arbitrarily many users to sequential programs with a few representative users, and shows that local bundles are relatively complete for parameterized safety verification, under moderate assumptions.

Analysis of Parameterized-Chain Networks: The Dependency Graph and Its Full, Consistent Subgraphs

This thesis studies algorithmic aspects of deadlock analysis for parameterized networks of discrete-event systems. A parameterized network consists of a finite, but arbitrarily large, number of

Verifying Solidity Smart Contracts via Communication Abstraction in SmartACE

This paper presents SmartACE, an automated framework for smart contract verification that implements local bundle abstractions that reduce verification from arbitrarily many users to a few representative users, and reports on the experience integrating Scribble with SmartACE.

An Approach for Identifying and Analyzing Implicit Interactions in Distributed Systems

The methods presented can help address the growing need for rigorous and practical methods and techniques for assuring the safe, secure, and reliable operation of distributed systems in critical domains.



Environment Abstraction for Parameterized Verification

This paper introduces environment abstraction as a tool for the verification of concurrent parameterized systems with unbounded variables and demonstrates the feasibility of the approach by verifying the safety and liveness properties of Lamport's bakery algorithm and Szymanski's mutual exclusion algorithm.

Parametrized invariance for infinite state processes

A general method for the verification of safety properties of parametrized programs that manipulate complex local and global data, including mutable state in the heap, which eases the development of decision procedures for complex data-types on top of off-the-shelf SMT solvers.

Parameterized Verification of Asynchronous Shared-Memory Systems

The results show that a robust, decidable class can be obtained under the assumptions of anonymity and asynchrony, and the problem is undecidable for finite-state machines operating with synchronization primitives, and already for two communicating pushdown machines.

Exploiting symmetry in temporal logic model checking

What it means for a finite state system to be symmetric is formalized and techniques for reducing such systems when the transition relation is given explicitly in terms of states or symbolically as a BDD are described.

Local Symmetry and Compositional Verification

A compositional reasoning principle for safety properties of process networks is formulated and symmetry groupoids and the quotient construction are defined and shown how symmetry and local reasoning can be expoited to provide parameterized proofs of correctness.

Automatic Deductive Verification with Invisible Invariants

The paper presents a method for the automatic verification of a certain class of parameterized systems consisting of N processes, where each process is finite-state, and generates invariants that can be transferred to the VC-validation phase without ever been examined by the user.

Parameterized Synthesis

This work shows that for specifications in LTL\X, parameterized synthesis of token ring networks is equivalent to distributed synthesis of a network consisting of a few copies of a single process, and sketches a general framework for parameterization synthesis based on cut-off results for verification.

Liveness with invisible ranking

The method of invisible ranking, presented here, generalizes the approach to liveness properties of parameterized systems and develops deductive proof rules for liveness and extend the small-model theorem to cover many intricate families of parameterization systems.

Reasoning about systems with many processes

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.

General decidability theorems for infinite-state systems

This paper presents decidability results for a class of systems, which consist of a finite control part operating on an infinite data domain, and shows that the following properties are decidable for well-structured systems: reachability; eventuality; and simulation.