8901566
SAT Based Predicate Abstraction for Hardware Verification
Predicate abstraction is an important technique for extracting compact finite state models from large or infinite state systems. Predicate abstraction uses decision procedures to compute a model which is amenable to model checking, and has been used successfully for software verification. Little work however has been done on applying predicate abstraction to large scale finite state systems, most notably, hardware, where the decision procedures are SAT solvers. We consider predicate abstraction for hardware in the framework of Counterexample-Guided Abstraction Refinement where in the course of verification, the abstract model has to be repeatedly refined. The goal of the refinement is to eliminate spurious behavior in the abstract model which is not present in the original model, and gives rise to false negatives (spurious counterexamples).
8658919
Using Combinatorial Optimization Methods for Quantification Scheduling
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BDDs) have significantly increased the size of the models that can be verified. The main problem in symbolic model checking is the image computation problem, i.e., efficiently computing the successors or predecessors of a set of states. This paper is an in-depth study of the image computation problem. We analyze and evaluate several newheuristics, metrics, and algorithms for this problem. The algorithms use combinatorial optimization techniques such as hill climbing, simulated annealing, and ordering by recursive partitioning to obtain better results than was previously the case. Theoretical analysis and systematic experimentation are used to evaluate the algorithms.
571032
Nonlinear quantification scheduling in image computation
Computing the set of states reachable in one step from a given set of states, i.e. image computation, is a crucial step in several symbolic verification algorithms, including model checking and reachability analysis. So far, the best methods for quantification scheduling in image computation, with a conjunctively partitioned transition relation, have been restricted to a linear schedule. This results in a loss of flexibility during image computation. We view image computation as a problem of constructing an optimal parse tree for the image set. The optimality of a parse tree is defined by the largest BDD that is encountered during the computation of the tree. We present dynamic and static versions of a new algorithm, VarScore, which exploits the flexibility offered by the parse tree approach to the image computation. We show by extensive experimentation that our techniques outperform the best known techniques so far.
1669235
Formal property verification by abstraction refinement with formal, simulation and hybrid engines
We present RFN, a formal property verification tool based on abstraction refinement. Abstraction refinement is a strategy for property verification. It iteratively refines an abstract model to better approximate the behavior of the original design in the hope that the abstract model alone will provide enough evidence to prove or disprove the property. However, previous work on abstraction refinement was only demonstrated on designs with up to 500 registers. We developed RFN to verify real-world designs that may contain thousands of registers. RFN differs from the previous work in several ways. First, instead of relying on a single engine, RFN employs multiple formal verification engines, including a BDD-ATPG hybrid engine and a conventional BDD-based fixpoint engine, for finding error traces or proving properties on the abstract model. Second, RFN uses a novel two-phase process involving 3-valued simulation and sequential ATPG to determine how to refine the abstract model. Third, RFN avoids the weakness of other abstraction-refinement algorithms-finding error traces on the original design, by utilizing the error trace of the abstract model to guide sequential ATPG to find an error trace on the original design. We implemented and applied a prototype of RFN to verify various properties of real-world RTL designs containing approximately 5,000 registers, which represents an order of magnitude improvement over previous results. On these designs, we successfully proved a few properties and discovered a design violation.
2942056
Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis
We introduce a SAT based automatic abstraction refinement framework for model checking systems with several thousand state variables in the cone of influence of the specification. The abstract model is constructed by designating a large number of state variables as invisible. In contrast to previous work where invisible variables were treated as free inputs we describe a computationally more advantageous approach in which the abstract transition relation is approximated by pre-quantifying invisible variables during image computation. The abstract counterexamples obtained from model-checking the abstract model are symbolically simulated on the concrete system using a state-of-the-art SAT checker. If no concrete counterexample is found, a subset of the invisible variables is reintroduced into the system and the process is repeated. The main contribution of this paper are two new algorithms for identifying the relevant variables to be reintroduced. These algorithms monitor the SAT checking phase in order to analyze the impact of individual variables. Our method is complete for safety properties (AGp) in the sense that - performance permitting - a property is either verified or disproved by a concrete counterexample. Experimental results are given to demonstrate the power of our method on real-world designs.
9827143
Making Predicate Abstraction Efficient: How to Eliminate Redundant Predicates
In this paper we consider techniques to identify and remove redundant predicates during predicate abstraction. We give three criteria for identifying redundancy. A predicate is redundant if any of the following three holds (i) the predicate is equivalent to a propositional function of other predicates. (ii) removing the predicate preserves safety properties satisfied by the abstract model (iii) removing it preserves bisimulation equivalence. We also show how to efficiently remove the redundant predicates once they are identified. Experimental results are included to demonstrate the effectiveness of our methods.
40850385
Trading off between Misclassification, Recognition and Generalization in Data Mining with Continuous Features
This paper aims at developing a data mining approach for classification rule representation and automated acquisition from numerical data with continuous attributes. The classification rules are crisp and described by ellipsoidal regions with different attributes for each individual rule. A regularization model trading off misclassification rate, recognition rate and generalization ability is presented and applied to rule refinement. A regularizing data mining algorithm is given, which includes self-organizing map network based clustering techniques, feature selection using breakpoint technique, rule initialization and optimization, classifier structure and usage. An Illustrative example demonstrates the applicability and potential of the proposed techniques for domains with continuous attributes.
14516368
A schema-based model for phonemic restoration
Phonemic restoration is the perceptual synthesis of phonemes when masked by appropriate replacement sounds by utilizing linguistic context. Current models attempting to accomplish acoustic restoration of phonemes, however, use only temporal continuity and produce poor restoration of unvoiced phonemes, and are also limited in their ability to restore voiced phonemes. We present a schema-based model for phonemic restoration. The model employs a missing data speech recognition system to decode speech based on intact portions and activates word templates corresponding to the words containing the masked phonemes. An activated template is dynamically time warped to the noisy word and is then used to restore the speech frames corresponding to the masked phoneme, thereby synthesizing it. The model is able to restore both voiced and unvoiced phonemes with a high degree of naturalness. Systematic testing shows that this model outperforms a Kalman-filter based model.
646293
An oscillatory correlation model of human motion perception
An oscillatory correlation model of human motion perception is proposed based on the integration of motion and luminance information. The model is composed of two parallel pathways that segment the input scene based on motion and luminance, respectively. Combining these segmentations, the model refines the motion estimates in the integration stage to obtain the final segmentation in the motion pathway. For segmentation, LEGION (locally excitatory globally inhibitory oscillator network) is employed whereby the phases of oscillators are used for region labeling. The model performance is demonstrated using a set of psychophysical data.
11091323
Learning Semantic Concepts from Visual Data Using Neural Networks
For content-based image retrieval techniques, query image is used to pick up and rank some relevant images from a database using some certain similarity metric. If semantic features are not involved in the modeling of visual data, the resulting system may demonstrate a disability of retrieving images likely associated with interesting semantic concepts of objects in the images. Therefore, issues on semantics representation, automatic extraction of semantic concepts from visual data, and effects of window size on the concepts recogni- tion are needed to study. This paper describes an approach towards these prob- lems. We first define a set of semantic concepts characterizing the outdoor im- ages. Then, a neural network is employed to memory the semantic concepts through pattern learning techniques. Lastly, the well-trained neural networks will perform as a classifier to identify the predefined semantics within an image. Empirical studies and comparison with decision tree techniques are carried out.
35035776
Hardware-software partitioning of real-time operating systems using Hopfield neural networks
Abstract The hardware–software automated partitioning of a real-time operating system in the system-on-a-chip (SoC-RTOS partitioning) is a NP-complete problem, and a crucial step in the hardware–software co-design of SoC. In this paper, a new model for SoC-RTOS partitioning is introduced, which can help in understanding the essence of the SoC-RTOS partitioning. A discrete Hopfield neural network approach for implementing the SoC-RTOS partitioning is proposed, where a novel energy function, operating equation and coefficients of the neural network are redefined. Simulations are carried out with comparison to other optimization techniques. Experimental results demonstrate the feasibility and effectiveness of the proposed method.