Results 1  10
of
13
Verifying Parameterized Networks using Abstraction and Regular Languages
, 1995
"... ion and Regular Languages ? E. M. Clarke 1 and O. Grumberg 2 and S. Jha 1 1 Carnegie Mellon University, Pittsburgh, PA 15213 2 Computer Science Dept, The Technion, Haifa 32000, Israel Abstract. This paper describes a technique based on network grammars and abstraction to verify families of ..."
Abstract

Cited by 47 (0 self)
 Add to MetaCart
ion and Regular Languages ? E. M. Clarke 1 and O. Grumberg 2 and S. Jha 1 1 Carnegie Mellon University, Pittsburgh, PA 15213 2 Computer Science Dept, The Technion, Haifa 32000, Israel Abstract. This paper describes a technique based on network grammars and abstraction to verify families of statetransition systems. The family of statetransition systems is represented by a contextfree network grammar. Using the structure of the network grammar our technique constructs an invariant which simulates all the statetransition systems in the family. A novel idea used in this paper is to use regular languages to express state properties. We have implemented our techniques and verified two nontrivial examples. 1 Introduction Automatic verification of statetransition systems using temporal logic model checking has been investigated by numerous authors [3, 4, 5, 12, 16]. The basic model checking problem is easy to state Given a statetransition system P and a temporal formula f , de...
Verifying Systems with Replicated Components in Murφ
, 1997
"... An extension to the Murphi verifier is presented to verify systems with replicated identical components. Although most systems are finitestate in nature, many of them are also designed to be scalable, so that a description gives a family of systems, each member of which has a different number of re ..."
Abstract

Cited by 42 (3 self)
 Add to MetaCart
An extension to the Murphi verifier is presented to verify systems with replicated identical components. Although most systems are finitestate in nature, many of them are also designed to be scalable, so that a description gives a family of systems, each member of which has a different number of replicated components. It is therefore desirable to be able to verify the entire family of systems, independent of the exact number of replicated components. The verification is performed by explicit state enumeration in an abstract state space where states do not record the exact numbers of components. We provide an extension to the existing Murphi language, by which a designer can easily specify a system in its concrete form. Through a new datatype, called RepetitiveID, a designer can suggest the use of this abstraction to verify a family of systems. First of all, Murphi automatically checks the soundness of this abstraction. Then it automatically translates the system description to an abstract ...
Formalized mathematics
 TURKU CENTRE FOR COMPUTER SCIENCE
, 1996
"... It is generally accepted that in principle it’s possible to formalize completely almost all of presentday mathematics. The practicability of actually doing so is widely doubted, as is the value of the result. But in the computer age we believe that such formalization is possible and desirable. In c ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
It is generally accepted that in principle it’s possible to formalize completely almost all of presentday mathematics. The practicability of actually doing so is widely doubted, as is the value of the result. But in the computer age we believe that such formalization is possible and desirable. In contrast to the QED Manifesto however, we do not offer polemics in support of such a project. We merely try to place the formalization of mathematics in its historical perspective, as well as looking at existing praxis and identifying what we regard as the most interesting issues, theoretical and practical.
Reachability Sets of Parametrized Rings As Regular Languages
 In Proc. 2nd Int. Workshop on Verification of Infinite State Systems (INFINITY’97
, 1997
"... We present here a method for deriving a regular language that characterizes the set of reachable states of a given parametrized ring (made of N of identical components). The method basically proceeds in two steps: first one generates a regular language L by inductive inference from a finite sample ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
We present here a method for deriving a regular language that characterizes the set of reachable states of a given parametrized ring (made of N of identical components). The method basically proceeds in two steps: first one generates a regular language L by inductive inference from a finite sample of reachable states; second one formally checks that L characterizes the whole set of reachable states. 1 Introduction During these last years, several kinds of methods have been explored in order to prove a property P about a ring of N identical finitestate processes irrespective of its size N . They are essentially three. The first is by induction (see, e.g., [20,19,13]), but often relies on human help for the introduction of appropriate `lemmas' or `invariants'. The second is by reduction to the verification problem for a fixed small size (e.g., N=2) (see, e.g., [10,17]), but works only for restrictive classes of rings. The third is by abstraction (see, e.g., [8,18,15]): an abstract mode...
On the Automatic Discovery of Loop Invariants
, 1997
"... We present a technique for automating the discovery of loop invariants based upon the analysis of failed proof attempts. Previously we have shown how failure analysis may be used productively in the search for inductive proofs. This work had direct application to the verification of functional progr ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
We present a technique for automating the discovery of loop invariants based upon the analysis of failed proof attempts. Previously we have shown how failure analysis may be used productively in the search for inductive proofs. This work had direct application to the verification of functional programs. Here we show how these ideas can also play an important role in the formal verification of imperative programs. While presented as an automatic technique we believe that our approach may be easily integrated within an interactive proof environment.
ContextMoving Transformations for Function Verification
, 1999
"... Several induction theorem provers have been developed which support mechanized verification of functional programs. Unfortunately, a major problem is that they often fail in verifying tail recursive functions (which correspond to imperative programs). However, in practice imperative programs are ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Several induction theorem provers have been developed which support mechanized verification of functional programs. Unfortunately, a major problem is that they often fail in verifying tail recursive functions (which correspond to imperative programs). However, in practice imperative programs are used almost exclusively. We present an automatic transformation to tackle this problem. It transforms functions which are hard to verify into functions whose correctness can be shown by the existing provers. In contrast to classical program transformations, the aim of our technique is not to increase efficiency, but to increase veriability. Therefore, this paper introduces a novel application area for program transformations and it shows that such techniques can in fact solve some of the most urgent current challenge problems in automated verification and induction theorem proving.
Symmetry and induction in model checking
 In Computer Science Today: Recent Trends and Developments
, 1995
"... ..."
Deaccumulation — Improving Provability
 Asian Computing Science Conference
, 2003
"... Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automated verification usually fails for functions with accumulating arguments. In particular, this holds for tailrecursive functions that correspond to imperative programs, but also for prog ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automated verification usually fails for functions with accumulating arguments. In particular, this holds for tailrecursive functions that correspond to imperative programs, but also for programs with nested recursion. Based on results from the theory of tree transducers, we develop an automatic transformation technique. It transforms accumulative functional programs into nonaccumulative ones, which are much better suited for automated verification by induction theorem provers. Hence, in contrast to classical program transformations aiming at improving the e#ciency, the goal of our deaccumulation technique is to improve the provability.
Efficiency of asynchronous systems, read arcs, and the MUTEXproblem
 TCS
, 1997
"... Two solutions to the MUTEXproblem are compared w.r.t. their temporal efficiency. For this, a formerly developed efficiency testing for asynchronous systems is adapted to Petri nets with socalled read arcs. Furthermore, a compositional semantics for fair behaviour (in the sense of the progress assu ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Two solutions to the MUTEXproblem are compared w.r.t. their temporal efficiency. For this, a formerly developed efficiency testing for asynchronous systems is adapted to Petri nets with socalled read arcs. Furthermore, a compositional semantics for fair behaviour (in the sense of the progress assumption) is presented. On the one hand, this semantics is related to efficiency testing; on the other hand, it is used to specify formally what a solution to the MUTEXproblem is. It is shown that one of our solutions indeed satisfies this specification and that ordinary nets without read arcs cannot solve the MUTEXproblem.