Exploitation of RT information in static property checking algorithms
نویسنده
چکیده
This document describes an approach for preserving the RTL structure of designs and properties to be exploited in property checking algorithms. Two approaches, for preprocessing such problems are considered, namely symmetry reduction and date path scaling, and the effects are outlined.
منابع مشابه
Microprocessor Verification using RT-Level Static Analysis Techniques
We present a technique for automatic verification of pipelined microprocessors using model checking. Antecedent conditioned slicing is an efficient abstraction technique for hardware designs at the Register Transfer Level (RTL). Antecedent conditioned slicing prunes the verification state space, using information from the antecedent of a given LTL property. In this work, we model instructions o...
متن کاملA Representative Function Approach to Symmetry Exploitation for CSP Refinement Checking
Effective temporal logic modelchecking algorithms exist that exploit symmetries arising from parallel composition of multiple identical components. These algorithms often employ a function rep from states to representative states under the symmetries exploited. We adapt this idea to the context of refinement checking for the process algebra CSP. In so doing, we must cope with refinementstyle ...
متن کاملrt-Inconsistency: A New Property for Real-Time Requirements
We introduce rt-inconsistency, a property of real-time requirements. The property reflects that the requirements specify apparently inconsistent timing constraints. We present an algorithm to check rt-inconsistency automatically. The algorithm works via a stepwise reduction to real-time model checking. We implement the algorithm using an existing module for the reduction and the UPPAAL tool for...
متن کاملAccelerating Coupled Applications through Register Level Communication between Processing Elements
Early SoCs have boosted parallelism exploitation for a limited number of embedded system applications that can be easily decomposed into multiple independent parts, thus enabling their facile execution on multiple Processing Elements (PEs) in parallel. However, as the computation complexity of the applications increases, the lockstep execution model is increasingly being questioned due to archi...
متن کاملAn Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems
Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004