Environment Abstraction for Parameterized Verification

  title={Environment Abstraction for Parameterized Verification},
  author={Edmund M. Clarke and Muralidhar Talupur and Helmut Veith},
Many aspects of computer systems are naturally modeled as parameterized systems which renders their automatic verification difficult. In well-known examples such as cache coherence protocols and mutual exclusion protocols, the unbounded parameter is the number of concurrent processes which run the same distributed algorithm. In this paper, we introduce environment abstraction as a tool for the verification of such concurrent parameterized systems. Environment abstraction enriches predicate… 

Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems

It is argued that natural abstractions for concurrent software are derived from the "Ptolemaic" perspective of a human engineer who focuses on a single reference process, and a new framework based on environment abstraction is proposed which exhibits a large degree of automation and can be easily adjusted to different fields of application.

Verification of Parameterized Systems with Combinations of Abstract Domains

This work presents a framework for verifying safety properties of parameterized systems based on a combination of Abstract Interpretation and a backward-reachability algorithm and provides an extrapolation operator for the domain to guarantee sound termination of the backward- Reachability algorithm.

Parameterized verification through view abstraction

The method handles the fine-grained and full version of Szymanski’s mutual exclusion protocol, whose correctness has not been proven automatically by any other existing methods.

Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems)

A simple and efficient method to prove safety properties for parameterized systems with linear topologies, which derives an over-approximation of the induced transition system, which allows the use of a simple class of regular expressions as a symbolic representation.

Structural Invariants for Parametric Verification of Systems with Almost Linear Architectures

This work synthesizes an induc-tive invariant that subsumes the set of reachable states and avoids the unsafe states from the formula describing the interactions of a concurrent system, without costly fixed point iterations.

Invariants for finite instances and beyond

A new algorithm is described, called BRAB, that is able to automatically infer invariants strong enough to prove a protocol like FLASH, which computes over-approximations of backward reachable states that are checked to be unreachable in a finite instance of the system.

Checking Parameterized PROMELA Models of Cache Coherence Protocols

This paper introduces a method for scalable verification of cache coherence protocols described in the PROMELA language, automated by a tool prototype that has been successfully applied to verification of the MOSI protocols implemented in the Elbrus computer systems.

Abstracting and Counting Synchronizing Processes

This work has implemented a tool Pacman, for predicated constrained monotonic abstraction, and used it to perform parameterized verification for several programs whose correctness crucially depends on precisely capturing the number of synchronizing processes.

Handling Parameterized Systems with Non-atomic Global Conditions

This work derives an over-approximation of the induced transition system, which leads to a symbolic scheme for analyzing safety properties of parameterized systems with linear topologies, and translates the problem into model checking of infinite transition systems where each configuration is a labeled finite graph.

Regular Model Checking without Transducers

A simple and efficient method to prove safety properties for parameterized systems with linear topologies using an overapproximation of the induced transition system, which allows the use of a simple class of regular expressions as a symbolic representation.



Automatic Verification of Parameterized Cache Coherence Protocols

With this application, it is shown that symbolic model checking tools originally designed for hybrid and concurrent systems can be applied successfully to a new class of infinite-state systems of practical interest.

Race checking by context inference

This work uses richer context models to infer suitable context models automatically by a combination of counterexample-guided abstraction refinement, bisimulation minimization, circular assume-guarantee reasoning, and parametric reasoning about an unbounded number of threads.

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.

Limits for Automatic Verification of Finite-State Concurrent Systems

Symbolic model checking with rich assertional languages

Regular Model Checking

Regular model checking is presented, a framework for algorithmic verification of infinite-state systems with, e.g., queues, stacks, integers, or a parameterized linear topology, by computation of the transitive closure of a transition relation.

Model checking guarded protocols

  • E. EmersonVineet Kahlon
  • Computer Science
    18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.
  • 2003
A broad framework for modeling snoopy cache protocols is presented for which the PMCP for p3 is decidable and that can model all snoopic cache protocols given by Culler and Emerson (1988) thereby overcoming the undecidability results.

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.

Liveness with (0, 1, ∞)-counter abstraction

The emphasis of the paper is on the derivation of an adequate and sound set of fairness requirements that enable proofs of liveness properties of the abstract system, from which one can safely conclude a corresponding liveness property of the original parameterized system.

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.