Explicit-enumeration Based Veriication Made Memory-eecient
نویسندگان
چکیده
| We investigate new techniques for reducing the memory requirements of an on-they model checking tool that employs explicit enumera-tion. Two techniques are studied in depth: exploiting symmetries in the model, and exploiting sequential regions in the model. These techniques can result in a signiicant reduction in memory requirements, and often nd progress violations at much lower stack depths. Both techniques have been implemented as part of the SPIN veriier, a widely used on-they model-checking tool.
منابع مشابه
Using Magnetic Disk Instead of Main Memory in the Mur' Veriier
In veriication by explicit state enumeration a randomly accessed state table is maintained. In practice, the total main memory available for this state table is a major limiting factor in veriication. We describe a version of the explicit state enumeration veriier Mur' that allows using magnetic disk instead of main memory for storing almost all of the state table. The algorithm avoids costly r...
متن کاملUsing Magnetic Disk instead of Main
In veriication by explicit state enumeration a randomly ac-cessed state table is maintained. In practice, the total main memory available for this state table is a major limiting factor in veriication. We describe a version of the explicit state enumeration veriier Mur' that allows the use of magnetic disk instead of main memory for storing almost all of the state table. The algorithm avoids co...
متن کاملProbabilistic Veri cation Using
This paper describes and analyzes a probabilistic technique to reduce the memory requirement of the table of reached states maintained in veriication by explicit state enumeration. The memory savings of the new scheme come at the price of a certain probability that the search becomes incomplete. However, this probability can be made negligibly small by using typically 40 bits of memory per stat...
متن کاملVerification of Logic Programs and Imperative Programs
This paper explores the relationship between veriication of logic programs and imperative programs with the aim of uncovering the kinds of reasoning used to construct logic programs. We discuss forward reasoning, such as that used for verifying imperative programs using the inductive assertion method, and backward reasoning, such as that used for verifying imperative programs using subgoal indu...
متن کاملDecomposition & Functional Verification of Fsms 1
In this paper we present a new method for the decomposition of a Finite State Machine (FSM) into a network of interacting FSMs and a framework for the functional veriication and simulation of the FSM network at diierent levels of abstraction. The problem of decomposition is solved using a multiway graph partitioning technique. The number of submachines is determined dynamically during the parti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995