Z. Khasidashvili, J. Moondanos, Daher Kaiss, Z. Hanna
{"title":"An enhanced cut-points algorithm in formal equivalence verification","authors":"Z. Khasidashvili, J. Moondanos, Daher Kaiss, Z. Hanna","doi":"10.1109/HLDVT.2001.972825","DOIUrl":"https://doi.org/10.1109/HLDVT.2001.972825","url":null,"abstract":"BDD-based cut-points verification is widely used informal verification. The authors have recently developed a cut-points verification algorithm that is unique in that it avoids generation of false-negatives and allows simplification of the circuits to be compared based on reconvergence of input variables. Here we describe several refinements and enhancements that lead both to drastic speedup as well increase in capacity. These methods are already implemented in Intel's combinational verifier CLEVER and show very promising results on real life examples from the pentium design family.","PeriodicalId":188469,"journal":{"name":"Sixth IEEE International High-Level Design Validation and Test Workshop","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128015435","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fast timed cosimulation of HW/SW implementation of embedded multiprocessor SoC communication","authors":"S. Yoo, G. Nicolescu, L. Gauthier, A. Jerraya","doi":"10.1109/HLDVT.2001.972811","DOIUrl":"https://doi.org/10.1109/HLDVT.2001.972811","url":null,"abstract":"To fast evaluate HW/SW implementation of multiprocessor SoC communication, we present a method to simulate operating systems (OSs) on a simulation host without running instruction set simulators and generic OS simulation models. The method enables fast timed OS simulation including the preemption of task execution. Together with the fast simulation of synthesizable HW code (e.g. in synthesizable C), it will enable fast evaluation of HW/SW implementation of multiprocessor SoC communication.","PeriodicalId":188469,"journal":{"name":"Sixth IEEE International High-Level Design Validation and Test Workshop","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116472020","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Reducing bitvector satisfiability problems to scale down design sizes for RTL property checking","authors":"P. Johannsen","doi":"10.1109/HLDVT.2001.972818","DOIUrl":"https://doi.org/10.1109/HLDVT.2001.972818","url":null,"abstract":"Formal bitvector theories have proven to be an adequate means of describing digital hardware at a higher level of design abstraction. Digital designs can be characterized by bitvector equations, such that design properties can be verified by determining satisfiability of such equations. Usually, satisfiability is checked in the Boolean domain by transforming systems of bitvector equations into Boolean formulae and afterwards applying bit-level verification techniques, like SAT and BDD procedures. The complexity of these methods often depends on the number of bit-level variables in the Boolean formulae, and thus depends on the sum of the widths of all bitvectors occurring in the equations. This paper presents a technique to reduce a system of equations over bitvectors of certain width into an equivalent system with smaller widths, while preserving satisfiability of the equations in a one-to-one fashion. The proposed reduction technique provides an efficient way to compute satisfying solutions of the original system from satisfying solutions found for the reduced system. We show how this technique can be used to speed up property checking of digital hardware by scaling down design sizes before verification.","PeriodicalId":188469,"journal":{"name":"Sixth IEEE International High-Level Design Validation and Test Workshop","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127746843","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Symbolic simulation techniques-state-of-the-art and applications","authors":"C. Blank, H. Eveking, Jens Levihn, G. Ritter","doi":"10.1109/HLDVT.2001.972806","DOIUrl":"https://doi.org/10.1109/HLDVT.2001.972806","url":null,"abstract":"A number of different techniques of symbolic simulation in particular at the behavioral and structural rt-level are classified. The principles of the TUD Symbolic Simulator used for equivalence checking are briefly outlined. The application of the tool to property checking is demonstrated. Experimental results with input languages Esterel and C are given.","PeriodicalId":188469,"journal":{"name":"Sixth IEEE International High-Level Design Validation and Test Workshop","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124596899","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Observability enhanced coverage analysis of C programs for functional validation","authors":"F. Fallah, Indradeep Ghosh","doi":"10.1109/HLDVT.2001.972823","DOIUrl":"https://doi.org/10.1109/HLDVT.2001.972823","url":null,"abstract":"Software programs written in some programming languages like C, C++, Java, etc, are mostly verified by functional simulation. Since exhaustive functional simulation is impossible for even a small sized C program, it is important to quantitatively measure the extent of design verification during simulation by a set of test vectors. Various coverage metrics have been proposed for measuring the degree of design verification. Most of them compute the extent of design excitation (controllability) but are unable to say whether the excitation responses have propagated to observable points in the program (observability). In this paper we propose a metric for code coverage analysis of C programs that addresses not only controllability but tackles observability as well. Thus, this metric is able to tell what percentage of the simulation responses have been propagated to observable points in the program like primary outputs or printed variables. We improve upon a recently proposed observability enhanced software coverage metric by increasing the accuracy of the analysis as well as decreasing the simulation runtime overhead. We report some preliminary results on example C programs.","PeriodicalId":188469,"journal":{"name":"Sixth IEEE International High-Level Design Validation and Test Workshop","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128264606","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On generation of the minimum pattern set for data path elements in SoC design verification based on port order fault model","authors":"Chun-Yao Wang, S. Tung, Jing-Yang Jou","doi":"10.1109/HLDVT.2001.972821","DOIUrl":"https://doi.org/10.1109/HLDVT.2001.972821","url":null,"abstract":"Embedded cores are being increasingly used in the design of large System-on-a-Chip. Because of the high complexity of SoC, the design verification is a challenge for system integrator To reduce the verification complexity, the port order fault model proposed by Tung and Jou (1998) has been used for verifying core-based designs and the corresponding verification pattern generation have been developed. Adders and multipliers are the most often used data path elements in core-based designs. Due to their regularity, the development of the verification pattern sets can be achieved in a systematic method. In this paper, we present the algorithms of generating the minimum verification pattern sets for adders and multipliers and these pattern sets are much smaller than that obtained from the automatic verification pattern generation proposed by Wang, Tung and Jou (2001).","PeriodicalId":188469,"journal":{"name":"Sixth IEEE International High-Level Design Validation and Test Workshop","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134424632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Relating buffer-oriented microarchitecture validation to high-level pipeline functionality","authors":"N. Utamaphethai, R. D. Blanton, John Paul Shen","doi":"10.1109/HLDVT.2001.972799","DOIUrl":"https://doi.org/10.1109/HLDVT.2001.972799","url":null,"abstract":"Buffer-Oriented Microarchitecture Validation (BMV) is a simulation-based validation method for systematically generating efficient test programs for exercising microarchitecture mechanisms. We present the relationship between high-level pipeline functionality for handling read-after-write (RAW) hazards and the design models derived in the BMV method. First, RAW failures are defined and classified into two categories based on the mechanism that is affected by a design error: pipeline interlock and result forwarding. Based on BMV models for the reservation station and the rename buffer, erroneous behaviors resulting in a pipeline interlock or a result forwarding failure can be mapped to a set of states in the models. Two theorems relating each failure class to BMV models for the reservation station and the rename buffer are derived and proved. The utility of the theorems is that they can be used to develop a RAW hazard simulator that is analogous to a single-stuck line fault simulator.","PeriodicalId":188469,"journal":{"name":"Sixth IEEE International High-Level Design Validation and Test Workshop","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133587499","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Hardware-software covalidation: fault models and test generation","authors":"I. Harris","doi":"10.1109/HLDVT.2001.972822","DOIUrl":"https://doi.org/10.1109/HLDVT.2001.972822","url":null,"abstract":"The increasing use of hardware-software systems in cost-critical and life-critical applications has led to heightened significance of design correctness of these systems. This paper presents a summary of research in hardware-software covalidation winch involves the verification of design correctness using simulation-based techniques. This paper focuses on the test generation process for hardware-software systems as well as the fault models and fault coverage analysis techniques which support test generation.","PeriodicalId":188469,"journal":{"name":"Sixth IEEE International High-Level Design Validation and Test Workshop","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121984647","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Improving test quality through resource reallocation","authors":"Allon Adir, E. Marcus, M. Rimon, Amir Voskoboynik","doi":"10.1109/HLDVT.2001.972809","DOIUrl":"https://doi.org/10.1109/HLDVT.2001.972809","url":null,"abstract":"Test program generation typically involves the resolution of constraints to make the tests legal and interesting for verification. This is often achieved through the values of resources used by the instructions in the test. The difficulty is that the number of available resources is limited, and there may be fewer available resources than needed values (especially in long tests). One way to get a large number of values from a limited number of resources, is to insert value-assigning instructions into the test before the instruction that is to use the resource's value. We refer to this as resource reloading. This paper presents a reloading technique that minimizes the interference caused. by the reloading instructions and avoids fixed code patterns by distancing the reloading instruction from the instruction that uses the resource value. The basic technique is presented along with several useful extensions and is compared with other reloading approaches.","PeriodicalId":188469,"journal":{"name":"Sixth IEEE International High-Level Design Validation and Test Workshop","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123403544","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Practical use of sequential ATPG for model checking: going the extra mile does pay off","authors":"M. Hsiao, J. Jain","doi":"10.1109/HLDVT.2001.972805","DOIUrl":"https://doi.org/10.1109/HLDVT.2001.972805","url":null,"abstract":"We present a study of the practical use of a simulation-based automatic test pattern generation (ATPG) for model checking in large sequential circuits. Preliminary findings show that ATPGs which gradually build and learn from the state-space has the potential to achieve the verification objective without needing the complete state-space information. The success of verifying a useful set of properties relies on the performance and capacity of ATPG. We compared an excitation-only ATPG with one that performs both excitation and propagation. Even though the excitation-only strategy suffices to justify the objective, the excitation-and-propagation ATPG achieved higher signal-justification coverages than the excitation-only counterpart. This is because excitation-only ATPG falls short in obtaining pertinent state information helpful for traversing the state space, resulting in ATPG aborting the objective. Our experiments demonstrated that incomplete but useful information learned via propagation can have significant impact on the performance of ATPG for model-checking.","PeriodicalId":188469,"journal":{"name":"Sixth IEEE International High-Level Design Validation and Test Workshop","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117089474","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}