Results 1  10
of
12
Experience with Predicate Abstraction
 IN COMPUTER AIDED VERIFICATION
, 1999
"... This reports some experiences with a recentlyimplemented prototype system for verification using predicate abstraction, based on the method of Graf and Saidi [9]. Systems are described using a language of iterated guarded commands, called MurOE \Gamma\Gamma (since it is a simplified version o ..."
Abstract

Cited by 143 (6 self)
 Add to MetaCart
This reports some experiences with a recentlyimplemented prototype system for verification using predicate abstraction, based on the method of Graf and Saidi [9]. Systems are described using a language of iterated guarded commands, called MurOE \Gamma\Gamma (since it is a simplified version of our MurOE protocol description language). The system makes use of two libraries: SVC [1] (an efficient decision procedure for quantifierfree firstorder logic) and the CMU BDD library. The use of these libraries increases the scope of problems that can be handled by predicate abstraction through increased efficiency, especially in SVC, which is typically called thousands of times. The verification system also provides limited support for quantifiers in formulas. The system ...
Automatic Deductive Verification with Invisible Invariants
, 2001
"... The paper presents a method for the automatic verification of a certain class of parameterized systems. These are boundeddata systems consisting of N processes (N being the parameter), where each process is finitestate. First, we show that if we use the standard deductive inv rule for proving inva ..."
Abstract

Cited by 103 (11 self)
 Add to MetaCart
(Show Context)
The paper presents a method for the automatic verification of a certain class of parameterized systems. These are boundeddata systems consisting of N processes (N being the parameter), where each process is finitestate. First, we show that if we use the standard deductive inv rule for proving invariance properties, then all the generated verification conditions can be automatically resolved by finitestate (bddbased) methods with no need for interactive theorem proving. Next, we show how to use modelchecking techniques over finite (and small) instances of the parameterized system in order to derive candidates for invariant assertions. Combining this automatic computation of invariants with the previously mentioned resolution of the VCs (verification conditions) yields a (necessarily) incomplete but fully automatic sound method for verifying boundeddata parameterized systems. The generated invariants can be transferred to the VCvalidation phase without ever been examined by the user, which explains why we refer to them as "invisible". We illustrate the method on a nontrivial example of a cache protocol, provided by Steve German.
Model Checking in CLP
, 1999
"... We show that Constraint Logic Programming (CLP) can serve as a conceptual basis and as a practical implementation platform for the model checking of infinitestate systems. Our contributions are: (1) a semanticspreserving translation of concurrent systems into CLP programs, (2) a method for verifyi ..."
Abstract

Cited by 103 (28 self)
 Add to MetaCart
We show that Constraint Logic Programming (CLP) can serve as a conceptual basis and as a practical implementation platform for the model checking of infinitestate systems. Our contributions are: (1) a semanticspreserving translation of concurrent systems into CLP programs, (2) a method for verifying safety and liveness properties on the CLP programs produced by the translation. We have implemented the method in a CLP system and verified wellknown examples of infinitestate programs over integers, using here linear constraints as opposed to Presburger arithmetic as in previous solutions.
Parameterized Verification with Automatically Computed Inductive Assertions
, 2001
"... The paper presents a method, called the method of verification by invisible invariants, for the automatic verification of a large class of parameterized systems. The method is based on the automatic calculation of candidate inductive assertions and checking for their inductiveness, using symbolic mo ..."
Abstract

Cited by 90 (9 self)
 Add to MetaCart
The paper presents a method, called the method of verification by invisible invariants, for the automatic verification of a large class of parameterized systems. The method is based on the automatic calculation of candidate inductive assertions and checking for their inductiveness, using symbolic modelchecking techniques for both tasks. First, we show how to use modelchecking techniques over finite (and small) instances of the parameterized system in order to derive candidates for invariant assertions. Next, we show that the premises of the standard deductive inv rule for proving invariance properties can be automatically resolved by finitestate (bddbased) methods with no need for interactive theorem proving. Combining the automatic computation of invariants with the automatic resolution of the VCs (verification conditions) yields a (necessarily) incomplete but fully automatic sound method for verifying large classes of parameterized systems. The generated invariants can be transferred to the VCvalidation phase without ever been examined by the user, which explains why we refer to them as "invisible". The efficacy of the method is demonstrated by automatic verification of diverse parameterized systems in a fully automatic and efficient manner.
Shape analysis through predicate abstraction and model checking
 In VMCAI 03: Verification, Model checking, and Abstract Interpretation, volume 2575 of LNCS
, 2003
"... ..."
(Show Context)
Predicate Abstraction
, 2003
"... Modern vehicles are increasingly equipped with more sensors which are connected to control units through cables for transmitting crucial realtime sensing data. To reduce the complexity and cost brought to the automotive design and production by the sensor wiring harness, replacing cables with wirel ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Modern vehicles are increasingly equipped with more sensors which are connected to control units through cables for transmitting crucial realtime sensing data. To reduce the complexity and cost brought to the automotive design and production by the sensor wiring harness, replacing cables with wireless links has been proposed in [1].With its fine capability of solving multipath fading and interference resilience, as well as its freely available spectrum, the ultrawideband (UWB) technology is considered as a highly promising candidate for such intravehicle wireless network. For the purpose of evaluating UWB based sensor network, compared with wired system, from the aspects of performance and reliability in transmitting automotive sensing data, an UWB communication testbed is needed. In this paper we present our first attempt in building an intravehicle UWB wireless sensor network to transmit automotive speed data from four wheel speed sensors to the electronic control unit (ECU) 1. Assembly of the testbed consists of ABS motor control simulating system, wheel speed sensors, UWB transmitting nodes and the UWB network coordinator interfacing with ECU. The paper also includes the description of the main testbed software modules and the report of initial measurement result. Future measurement plan and further work needed to improve the testbed are discussed in the conclusion section. 1
Automatic Abstraction in Model Checking
, 2000
"... As technology advances and demand for higher performance increases hardware designs are becoming more and more sophisticated. A typical chip design may contain over ten million switching devices. Since the systems become more and more complex, detecting design errors for systems of such scale become ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
As technology advances and demand for higher performance increases hardware designs are becoming more and more sophisticated. A typical chip design may contain over ten million switching devices. Since the systems become more and more complex, detecting design errors for systems of such scale becomes extremely difficult. Formal verification methodologies can potentially catch subtle design errors. However, many stateoftheart formal verification tools suffer from the state explosion problem. This thesis explores abstraction techniques to avoid the state explosion problem. In our methodology, atomic formulas extracted from an SMVlike concurrent program are used to construct abstraction functions. The initial abstract structure is built by using existential abstraction techniques. When the model checker disproves a universal property on the abstract structure, it generates a counterexample. However, this abstract counterexample might be spurious because abstraction is not complete. We provide a new symbolic algorithm to determine whether an abstract counterexample is spurious. When a counterexample is identified to be spurious, the algorithm will compute the shortest prefix of the abstract counterexample that does not correspond to an actual trace in the concrete model. The last abstract state in this prefix is split into less abstract states so that the spurious counterexample is eliminated. Thus, a more refined abstraction function is obtained. It is usually desirable to obtain the coarsest refinement which eliminates the counterexample because this corresponds to the smallest abstract model that avoids the spurious counterexample. We prove, however, that finding the coarsest refinement is NPhard. Because of this, we use a polynomialtime algorithm which gives a su...
Abstraction as the Key for Invariant Verification
, 2003
"... We present a methodology for constructing abstractions and refining them by analyzing counterexamples. We also present a uniform verification method that combines abstraction, modelchecking and deductive verification. In particular, it shows how to use the abstract system in a deductive proof ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a methodology for constructing abstractions and refining them by analyzing counterexamples. We also present a uniform verification method that combines abstraction, modelchecking and deductive verification. In particular, it shows how to use the abstract system in a deductive proof even when the abstract model does not satisfy the specification and when it simulates the concrete system with respect to a weaker notion of simulation than Milner's.
Bang: A Boolean Automata Network Grammar checker
, 1997
"... Bang is a Bddbased symbolic verification tool devoted to "Boolean Automata Network Grammar". Network grammar is an useful formalism to describe infinite process as a composition of finite processes. The problem of verifying that such a network satisfy a property, is solved by computing an ..."
Abstract
 Add to MetaCart
Bang is a Bddbased symbolic verification tool devoted to "Boolean Automata Network Grammar". Network grammar is an useful formalism to describe infinite process as a composition of finite processes. The problem of verifying that such a network satisfy a property, is solved by computing an invariant for each subnetwork. 1