{"title":"Transaction Routing and its Verification by Correct Model Transformations","authors":"S. Abdi, D. Gajski","doi":"10.1109/HLDVT.2006.319975","DOIUrl":"https://doi.org/10.1109/HLDVT.2006.319975","url":null,"abstract":"This paper presents model transformations that are encountered in refining an abstract point-to-point transaction between two processes into a complex transaction, routed over the communication architecture, consisting of multiple busses and bridges. These transformations form part of synthesizing an abstract specification model into a detailed model representing the implementation of that specification onto a platform. We present these transformations in the context of a modeling formalism that has well defined execution semantics and a notion of functional equivalence. The transformations are proven correct using our notion of equivalence. We also present methods for deriving the proof of equivalence between the abstract model and the refined model. Based on these methods, we have implemented a tool that automatically proves whether or not the model generated after transaction routing is indeed equivalent to the input model. Experimental results for large industrial examples demonstrate the feasibility, utility and efficiency of our tool and the underlying methods","PeriodicalId":171230,"journal":{"name":"2006 IEEE International High Level Design Validation and Test Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129121947","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":"Automated Coverage Directed Test Generation Using a Cell-Based Genetic Algorithm","authors":"Amer Samarah, A. Habibi, S. Tahar, N. Kharma","doi":"10.1109/HLDVT.2006.319996","DOIUrl":"https://doi.org/10.1109/HLDVT.2006.319996","url":null,"abstract":"Functional verification is a major challenge in the hardware design development cycle. Defining the appropriate coverage points that capture the design's functionalities is a non-trivial problem. However, the real bottleneck remains in generating the suitable testbenches that activate those coverage points adequately. In this paper, we propose an approach to enhance the coverage rate of multiple coverage points through the automatic generation of appropriate test patterns. We employ a directed random simulation, where directives are continuously updated until achieving acceptable coverage rates for all coverage points. We propose to model the solution of the test generation problem as sequences of directives or cells, each of them with specific width, height and distribution. Our approach is based on a genetic algorithm, which automatically optimizes the widths, heights and distributions of these cells over the whole input domain with the aim of enhancing the effectiveness of test generation. We illustrate the efficiency of our approach on a set of designs modeled in SystemC","PeriodicalId":171230,"journal":{"name":"2006 IEEE International High Level Design Validation and Test Workshop","volume":"28 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131858988","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}
A. Maman, Sharon Goldshlager, H. Miller, D. Bell, Rob Slater, O. Ben-Moshe, Nissan Levi, Hagit Gilboa
{"title":"Reusable On-Chip System Level Verification for Simulation Emulation and Silicon","authors":"A. Maman, Sharon Goldshlager, H. Miller, D. Bell, Rob Slater, O. Ben-Moshe, Nissan Levi, Hagit Gilboa","doi":"10.1109/HLDVT.2006.319974","DOIUrl":"https://doi.org/10.1109/HLDVT.2006.319974","url":null,"abstract":"Absolute verification of system on chip (SoC) has become infeasible due to the huge number of chip-level scenarios to cover. System level verification validates the integration of independently-verified components such as cores, peripherals, caches and memories. Some of the most elusive system level bugs can only be detected by scenarios that exercise several components, each in a different configuration. This paper presents a methodology for SoC system level verification, comprised of high level software that simultaneously exercises multiple hardware components. It consists of a light operating system which schedules threads for non-preemptive interleaved runs. Each thread complies with a uniform structure, and activates a specific functionality of the system. The interaction of multiple threads allows for realistic scenarios, testing bus traffic stress, multiplexing, and state machines, reaching unanticipated corner-cases. The OS includes a run time constraint solver for randomly selecting parameters for peripheral configuration. Similar capabilities require dedicated testbenches such as Vera or e which lack compilers and thus cannot be applied to silicon. The described framework is not dependent on a specific tool, but based on C, therefore compiled to chip. Reusability over project life-cycle is achieved by having the same test-cases run on simulation, emulation and silicon, allowing comparison of test results. A simulation speed-up of over 100times is achieved, by replacing RTL core with stub, compiling application code to the host machine, and using an API for the interaction of the design and application. This methodology was applied to the new Quad-Core MSC8144 supporting a very high I/O bandwidth and providing an optimal DSP solution for wireline/wireless infrastructure applications. The same methodology was used in simulation, emulation and silicon modes. It led to high coverage of system level scenarios, and discovery of system level bugs which could have taken much longer to be found by other methodologies","PeriodicalId":171230,"journal":{"name":"2006 IEEE International High Level Design Validation and Test Workshop","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134618931","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":"Disjunctive Transition Relation Decomposition for Efficient Reachability Analysis","authors":"S. Stergiou, J. Jain","doi":"10.1109/HLDVT.2006.319997","DOIUrl":"https://doi.org/10.1109/HLDVT.2006.319997","url":null,"abstract":"The applicability of disjunctive transition relation decompositions in the context of symbolic model checking is researched. An algorithm that generates such decompositions is proposed and evaluated on the VIS benchmarks. The obtained decompositions are well-balanced and the algorithm compares well with IWLS'95","PeriodicalId":171230,"journal":{"name":"2006 IEEE International High Level Design Validation and Test Workshop","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128440674","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":"Efficient Automata-Based Assertion-Checker Synthesis of PSL Properties","authors":"M. Boule, Z. Zilic","doi":"10.1145/1297666.1297670","DOIUrl":"https://doi.org/10.1145/1297666.1297670","url":null,"abstract":"Automata-based methods for generating PSL hardware assertion checkers were primarily considered for use with temporal sequences, as opposed to full-scale properties. We present a technique for automata-based checker generation of PSL properties for dynamic verification. A full automata-based approach allows an entire assertion to be represented by a single automaton, hence allowing optimizations which can not be done in a modular approach where sub-circuits are created only for individual operators. For this purpose, automata algorithms are developed for the base cases, and a complete set of rewrite rules is developed and applied for all other operators. We show that the generated checkers are resource-efficient for use in hardware emulation, simulation acceleration and silicon debug","PeriodicalId":171230,"journal":{"name":"2006 IEEE International High Level Design Validation and Test Workshop","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126652311","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":"Equivalence Checking with Rule-Based Equivalence Propagation and High-Level Synthesis","authors":"Tasuku Nishihara, Takeshi Matsumoto, M. Fujita","doi":"10.1109/HLDVT.2006.319984","DOIUrl":"https://doi.org/10.1109/HLDVT.2006.319984","url":null,"abstract":"Equivalence checking is one of the most important issues in VLSI designs to guarantee that bugs do not enter the design during optimization steps or synthesis steps. In this paper, we propose a new word-level equivalence checking method between two models before and after high-level synthesis or behavioral optimization. Our method converts two given designs into RTL models which have the same datapath so that the two designs have the same bit-level accuracy. Then the word-level equivalence checking techniques can be applied satisfying the bit-level accuracy. Also, as our method propagates equivalences from inputs to outputs with the equivalence rules of control structures, name correspondences among registers or variables are not required. By those rules, designs which have loops can be verified without unrolling. Experimental results with realistic examples show that our method can verify those designs in practical periods","PeriodicalId":171230,"journal":{"name":"2006 IEEE International High Level Design Validation and Test Workshop","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128894671","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":"Test Directive Generation for Functional Coverage Closure Using Inductive Logic Programming","authors":"Hsiou-Wen Hsueh, K. Eder","doi":"10.1109/HLDVT.2006.320005","DOIUrl":"https://doi.org/10.1109/HLDVT.2006.320005","url":null,"abstract":"Functional verification is a complex and time-consuming task in the design process. Recently, various approaches have been developed to improve verification efficiency, including advanced coverage analysis techniques, coverage-driven verification methodologies and coverage-directed stimulus generation techniques. One remaining challenge is to fully automate functional coverage closure. This paper presents a novel approach for coverage-directed stimulus generation based on inductive learning from examples. Test sequences and their related coverage are examined to induce general rules which describe the characteristics of these tests. Coverage closure can be automated by applying the rule learning to clusters similar to the target coverage hole and combining the resulting rules to obtain directives for test generation. The validity of the approach is demonstrated on a pilot case study","PeriodicalId":171230,"journal":{"name":"2006 IEEE International High Level Design Validation and Test Workshop","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133877845","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":"Polychronous Methodology For System Design: A True Concurrency Approach","authors":"S. Suhaib, D. Mathaikutty, S. Shukla, J. Talpin","doi":"10.1109/HLDVT.2006.319993","DOIUrl":"https://doi.org/10.1109/HLDVT.2006.319993","url":null,"abstract":"As embedded systems have become pervasive and ubiquitous in contemporary technologies, their development requires highly reliable design approaches. One of these approaches is the so-called synchronous programming paradigm, where its mathematical basis provides the required formal concepts to satisfy correctness expectations. Among these synchronous programming concepts, the multi-clocked model of computation of polychrony stands out for its capability to give high-level and homogeneous descriptions of concurrent systems, where its concurrent parts may evolve asynchronously to each other and synchronize intermittently. In this paper, we propose a 'true concurrency' semantic model of polychrony using pomsets. This formulation of polychrony closes the gap between synchrony and asynchrony by giving a uniform characterization of both synchronous and asynchronous observations by considering the causality and functional dependency structure of a pomset. The results in this paper also show that the existing tagged-signal model for polychrony uses an unnecessary artifact namely, tags, which complicate the semantic theory unduly","PeriodicalId":171230,"journal":{"name":"2006 IEEE International High Level Design Validation and Test Workshop","volume":"233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121891653","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":"IChecker: An Efficient Checker for Inductive Invariants","authors":"Feng Lu, K. Cheng","doi":"10.1109/HLDVT.2006.319987","DOIUrl":"https://doi.org/10.1109/HLDVT.2006.319987","url":null,"abstract":"Invariants in sequential circuits could be very useful for sequential optimizations and for speeding up functional verification tasks. However, the lack of efficient and scalable invariant identification tools limits their usage. In this paper, we present a new tool, IChecker, for efficient identification of true invariants for any given initial set of invariant candidates. ICheker uses new circuit simplification techniques to iteratively minimize constrained circuit models, along with a number of heuristics for efficient computation of invariants. Experimental results demonstrate the high efficiency and effectiveness of the proposed approach for identifying sequential invariants","PeriodicalId":171230,"journal":{"name":"2006 IEEE International High Level Design Validation and Test Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125820586","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}
S. Shukla, A. Hu, J. Abrahams, P. Ashar, H. Foster, A. Landver, C. Pixley
{"title":"Panel: Assertion-Based Verification -What's the Big Deal?","authors":"S. Shukla, A. Hu, J. Abrahams, P. Ashar, H. Foster, A. Landver, C. Pixley","doi":"10.1109/HLDVT.2006.319989","DOIUrl":"https://doi.org/10.1109/HLDVT.2006.319989","url":null,"abstract":"Summary form only given. Assertion based validation of hardware and software systems has been in use in the industry for a long time. In the software languages such as C++ or Java, there are special assert constructs that are used to specify a Boolean condition. These conditions express what the programmers think ought to hold, at specific points in their programs. Violations of such assertions provide clues about the program state at those points during execution and hence indicate the existence of bugs. In hardware design especially at the RTL and higher abstraction levels, similar assertions have been used originally in proprietary languages, and more recently with PSL (Property Specification Language). PSL was standardized initially by Accellera, and later by IEEE. PSL and similar assertion languages allow not only Boolean expressions, but more complex constructs involving temporal behaviors. Therefore, these languages can be used for checking assertions at certain points of the model execution, as well as for formal property verification. Standardization of PSL gave rise to a lot of interest in the hardware design industry, and various formal and simulation based techniques have been integrated into the validation tools from the various EDA companies. The question in front of the panel is if the assertion based verification a panacea for the validation gap problem in the design industry, and if not, where the short comings are. Industry experts from Synopsys, Cadence, Mentor Graphics, Real Intent, and from Academia debated these questions at this panel","PeriodicalId":171230,"journal":{"name":"2006 IEEE International High Level Design Validation and Test Workshop","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117000204","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}