{"title":"Clock domain verification challenges and scalable solutions","authors":"P. Ashar","doi":"10.1109/HLDVT.2010.5496661","DOIUrl":"https://doi.org/10.1109/HLDVT.2010.5496661","url":null,"abstract":"With chip-design risk at worrying levels, a verification methodology based on just linting and simulation does not cut it. Real Intent has demonstrated that identifying specific sources of verification complexity and deploying automatic customized technologies to tackle them surgically has benefit. Automatic and customized don't go together at first glance. Whereas automatic deals with maximizing productivity in setup, analysis and debug, customized ensures comprehensiveness. That's the challenge for clock-domain verification as well as for the plethora of other failure modes in modern chips. Clock-domain verification is certainly a case in point. Its complexity has grown tremendously:","PeriodicalId":200068,"journal":{"name":"2010 IEEE International High Level Design Validation and Test Workshop (HLDVT)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134154517","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":"An ontology and constraint based approach to cache preloading","authors":"Rajiv Bhatia, E. Bin, E. Marcus, G. Shurek","doi":"10.1109/HLDVT.2010.5496651","DOIUrl":"https://doi.org/10.1109/HLDVT.2010.5496651","url":null,"abstract":"The verification of modern microprocessor-based systems requires stressing the cache hierarchy and effectively covering its huge state space. Cache hierarchy initialization (or preloading) is a technique that enables simulation to start from a rich, complex system-level setup, thereby simplifying the task of dynamically driving the hierarchy into the required corner cases. In this paper we introduce CacheLoader, a new, design-independent cache-preloading technology. The tool's architecture follows the principles of ontology-based software to achieve complete separation between the cache-preloading engine and design dependent knowledge. Constraint satisfaction techniques are used to generate valid, interesting system initialization, and to satisfy explicit user directives. CacheLoader is currently being used by verification teams of several large scale designs in IBM. Results show that this technique provides superior coverage and user controllability, speeds up the construction of mature verification environments, simplifies maintenance, encourages encapsulation of domain knowledge, and enables reuse across verification environments and cache hierarchy designs.","PeriodicalId":200068,"journal":{"name":"2010 IEEE International High Level Design Validation and Test Workshop (HLDVT)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122005535","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":"Utility of transaction-level hardware models in refinement checking","authors":"Yogesh S. Mahajan, S. Malik","doi":"10.1109/HLDVT.2010.5496650","DOIUrl":"https://doi.org/10.1109/HLDVT.2010.5496650","url":null,"abstract":"Verifying a cycle-accurate RTL model against its functional specification using refinement checking uses a joint execution model to compare the executions of the two models. Creating and instrumenting such a joint execution model manually can be tedious and error-prone. In this paper, we illustrate the use of transaction-based models (e.g. [1]) in simplifying the process of creating and instrumenting joint execution models for refinement checking. We first show how transaction-based specification and implementation models allow simple refinement relations to be written using model variables and constructs. We then show how a joint encoding of the two models can be generated together with assertions expressing the specified refinement relation. This approach avoids the manual bookkeeping otherwise needed for coordinating the executions of the design and the specification, and exchanging information between the two models. We illustrate the ideas on a toy example.","PeriodicalId":200068,"journal":{"name":"2010 IEEE International High Level Design Validation and Test Workshop (HLDVT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117110100","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":"Automatic synthesis of OSCI TLM-2.0 models into RTL bus-based IPs","authors":"N. Bombieri, F. Fummi, V. Guarnieri","doi":"10.1109/HLDVT.2010.5496652","DOIUrl":"https://doi.org/10.1109/HLDVT.2010.5496652","url":null,"abstract":"Transaction-level modeling (TLM) is the most promising technique to deal with the increasing complexity of modern embedded systems. TLM provides designers with high-level interfaces and communication protocols for abstract modeling and efficient simulation of system platforms. The Open SystemC Initiative (OSCI) has recently released the TLM-2.0 standard, to standardize the interface between component models for bus-based systems. The TLM standard aims at facilitating the interchange of models between suppliers and users, and thus encouraging the use of virtual platforms for fast simulation prior to the availability of register-transfer level (RTL) code. On the other hand, because a TLM IP description does not include the implementation details that must be added at the RTL, the process to synthesize TLM designs into RTL implementations is still manual, time spending and error prone. In this context, this paper presents a methodology for automating the TLM-to-RTL synthesis by applying the theory of high-level synthesis (HLS) to TLM, and proposes a protocol synthesis technique based on the extended finite state machine (EFSM) model for generating the RTL IP interface compliant with any RTL bus-based protocol.","PeriodicalId":200068,"journal":{"name":"2010 IEEE International High Level Design Validation and Test Workshop (HLDVT)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128471650","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":"Analysis of range and precision for fixed-point linear arithmetic circuits with feedbacks","authors":"O. Sarbishei, Yu Pang, K. Radecka","doi":"10.1109/HLDVT.2010.5496667","DOIUrl":"https://doi.org/10.1109/HLDVT.2010.5496667","url":null,"abstract":"Analysis of range and precision is always an important task for high level synthesis and verification. Although several researches have been dedicated to these two problems, in the case of linear fixed-point arithmetic circuits with feedbacks such as an Infinite Impulse Response (IIR) filter, conventional approaches are either constituting major overestimations or cannot handle arbitrary order feedback circuits. In this paper we focus on this problem and propose two efficient heuristics for range and precision analysis of such circuits, when the input and error bounds are given. The methods can be used for efficient integer and fractional bit-width allocation in the optimization flow. Moreover, for the purpose of module reusability and matching, verification algorithms have been proposed. Experimental results prove robust computations of range and precision.","PeriodicalId":200068,"journal":{"name":"2010 IEEE International High Level Design Validation and Test Workshop (HLDVT)","volume":"86 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132756343","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}
G. D. Guglielmo, F. Fummi, G. Pravadelli, S. Soffia, Marco Roveri
{"title":"Semi-formal functional verification by EFSM traversing via NuSMV","authors":"G. D. Guglielmo, F. Fummi, G. Pravadelli, S. Soffia, Marco Roveri","doi":"10.1109/HLDVT.2010.5496660","DOIUrl":"https://doi.org/10.1109/HLDVT.2010.5496660","url":null,"abstract":"Simulation-based verification of hardware systems is well-established in industrial practice thanks to the ease-of-use of the approach and to its scalability. However, it notoriously suffers from the lack of exhaustiveness. On the other hand, while pure formal verification techniques provide high confidence in the design correctness, they are very limited in terms of scalability. As an alternative, semi-formal validation techniques are currently under investigation. Semi-formal approaches fulfil the tradeoff between high-coverage results, scalability of the design, and reduced resource requirements. In this work, a semi-formal approach for hardware verification is presented by exploiting constrained random simulation and extended finite state machine (EFSM) traversal through heuristics. The proposed heuristics aim to uniformly, and rapidly, visit the design space, exploiting a NuSMV-based constraint solving technique to efficiently cover corner cases. In this context, a constraint solving interface has been built on top of the NuSMV model checker. We present experimental results comparing the proposed heuristics with existent approaches, and the effectiveness of our NuSMV-based strategy with respect to the adoption of a state of the art constraint solver (ECLiPSe).","PeriodicalId":200068,"journal":{"name":"2010 IEEE International High Level Design Validation and Test Workshop (HLDVT)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131764187","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}
W. Ecker, Volkan Esen, Rainer Findenig, T. Steininger, Michael Velten
{"title":"Model reduction techniques for the formal verification of hardware dependent software","authors":"W. Ecker, Volkan Esen, Rainer Findenig, T. Steininger, Michael Velten","doi":"10.1109/HLDVT.2010.5496647","DOIUrl":"https://doi.org/10.1109/HLDVT.2010.5496647","url":null,"abstract":"Contemporary researches provide many solutions for formally verifying both hardware and software systems. In this paper, we describe the formal verification of assembly programs, which are part of the HW/SW interface in hybrid systems. We have developed several methods to model assembly programs in VHDL in order to verify their functionality. Our discussion will show that, by applying different reduction methods, we managed to formally verify the correctness of iterative algorithms with execution times higher than 6000 clock cycles.","PeriodicalId":200068,"journal":{"name":"2010 IEEE International High Level Design Validation and Test Workshop (HLDVT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129830041","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}
W. Mueller, Marcio Ferreira da Silva Oliveira, H. Zabel, Markus Becker
{"title":"Verification of real-time properties for Hardware-dependent Software","authors":"W. Mueller, Marcio Ferreira da Silva Oliveira, H. Zabel, Markus Becker","doi":"10.1109/HLDVT.2010.5496644","DOIUrl":"https://doi.org/10.1109/HLDVT.2010.5496644","url":null,"abstract":"Seamless HW/SW codesign flows support early verification of hardware and Hardware-dependent Software (HdS) like drivers, operating systems, and firmware. For early estimation and verification, the application of SystemC in combination with Instruction Set Simulators and Software Emulators like QEMU is widely accepted. In this article, we present an advanced design flow for HW, (RT)OS and HdS refinement and verification with focus on the transition from abstract RTOS verification to full system RTOS/HdS emulation. In the context of assertion-based verification, we introduce a set of generic real-time properties which can be reused and verified at different abstraction levels and discuss their application. The properties are presented by the means of IEEE standard PSL assertions which are applied for mixed SystemC/HdS models.","PeriodicalId":200068,"journal":{"name":"2010 IEEE International High Level Design Validation and Test Workshop (HLDVT)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122394347","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}
D. Gomez-Prado, Dusung Kim, M. Ciesielski, E. Boutillon
{"title":"Retiming arithmetic datapaths using Timed Taylor Expansion Diagrams","authors":"D. Gomez-Prado, Dusung Kim, M. Ciesielski, E. Boutillon","doi":"10.1109/HLDVT.2010.5496664","DOIUrl":"https://doi.org/10.1109/HLDVT.2010.5496664","url":null,"abstract":"This paper describes an extension to the Taylor Expansion Diagrams (TED), called Timed TEDs, which makes it possible to represent sequential arithmetic datapaths. Timed TEDs enable register and clock period minimization while performing factorizations and common sub expression eliminations in the data flow graph (DFG). Specifically, timed TEDs allow a wider range of retiming options as the computations in the DFG can be modified while performing retiming. In this paper we discuss the formalism of timed TEDs and the restrictions it imposes on the TED variable ordering.","PeriodicalId":200068,"journal":{"name":"2010 IEEE International High Level Design Validation and Test Workshop (HLDVT)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124578970","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":"Towards analyzing functional coverage in SystemC TLM property checking","authors":"H. M. Le, Daniel Große, R. Drechsler","doi":"10.1109/HLDVT.2010.5496658","DOIUrl":"https://doi.org/10.1109/HLDVT.2010.5496658","url":null,"abstract":"For Electronic System Level (ESL) design SystemC has become the standard language due to its excellent support of Transaction Level Modeling (TLM). But even if the complexity of the systems can be handled using the abstraction levels offered by TLM - the most abstract one is untimed and focuses on functionality - still verification is the major bottleneck. In particular, as untimed TLM models are the reference for the following refinement steps their correctness has to be ensured. Thus, formal verification approaches have been developed to prove properties for these models. However, even if several properties have been checked this does not guarantee that the complete functionality of the TLM model has been verified. Thus, in this paper we consider the problem of functional coverage analysis in formal TLM property checking. We present a coverage approach which can analyze whether the property set unambiguously describes all transactions in a SystemC TLM model. The developed coverage analysis method identifies uncovered scenarios and hence allows to close all coverage gaps. As an example we consider an automated teller machine and we show the benefits of the proposed approach.","PeriodicalId":200068,"journal":{"name":"2010 IEEE International High Level Design Validation and Test Workshop (HLDVT)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121676630","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}