Abstract:The emergence of hardware construction languages (HCLs), such as PyRTL, PyHDL, and PyMTL, for microprocessor RTL design in agile hardware design methodology brings new challenges to design verification. However, most of the existing dynamic verification techniques for microprocessor RTL designs in HCLs are lacking sufficient consideration of constraints of valid instructions in a given instruction-set architecture (ISA). In contrast, such constraints are pervasive in microprocessor RTL design. This may degrade coverage achievements and the efficiency of the verification process. In this paper, we propose to enhance the coverage-directed dynamic verification method for microprocessor RTL design in several aspects. First, we combine grammar-based fuzz testing and symbolic simulation to generate test instructions for improving coverage. Second, we propose to employ a grammar-based fuzz testing technique by exploiting constraints of valid ISA instructions of a microprocessor under verification. Finally, we implement all the enhancements in a test generation tool, named MPFuzz, for testing microprocessor RTL designs in PyRTL. Experimental results show that MPFuzz can efficiently generate test instructions for microprocessor RTL designs in PyRTL. The test instructions generated by MPFuzz can achieve higher coverage at least four times than that by the state-of-the-art fuzzing-based RTL test generation tool.

Alert Name:
Alerting to:
Authentication email will be sent to your email address in 24 hours
Frequency:
Email Message Format:	Plain text Graphical(HTML)

Complete the form below and we will recommend the selected titles to your friends on your behalf. * Indicates a required field.
Your name*:
Your email address*:
Recipient's name*:
Recipient's email address*:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find the page(s) useful.

Your name:
Your email address:
Recipient's name:
Recipient's email address:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find this page useful.

Disclaimer: This message was sent to your friend using the "Send it to a friend" facility on the Sciencepaper Online’ WWW site, http://www.paper.edu.cn/en. The Sciencepaper Online is not responsible for the content of this email, and anything said in this email does not necessarily reflect the Sciencepaper Online's views.


	1. Grammar-based Fuzz Testing for Microprocessor RTL Design
	LUO Dan,LI Tun,CHEN Liqian,ZOU Hongji,SHI Mingchuan
	Computer Science and Technology 24 September 2021
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The emergence of hardware construction languages (HCLs), such as PyRTL, PyHDL, and PyMTL, for microprocessor RTL design in agile hardware design methodology brings new challenges to design verification. However, most of the existing dynamic verification techniques for microprocessor RTL designs in HCLs are lacking sufficient consideration of constraints of valid instructions in a given instruction-set architecture (ISA). In contrast, such constraints are pervasive in microprocessor RTL design. This may degrade coverage achievements and the efficiency of the verification process. In this paper, we propose to enhance the coverage-directed dynamic verification method for microprocessor RTL design in several aspects. First, we combine grammar-based fuzz testing and symbolic simulation to generate test instructions for improving coverage. Second, we propose to employ a grammar-based fuzz testing technique by exploiting constraints of valid ISA instructions of a microprocessor under verification. Finally, we implement all the enhancements in a test generation tool, named MPFuzz, for testing microprocessor RTL designs in PyRTL. Experimental results show that MPFuzz can efficiently generate test instructions for microprocessor RTL designs in PyRTL. The test instructions generated by MPFuzz can achieve higher coverage at least four times than that by the state-of-the-art fuzzing-based RTL test generation tool.
	TO cite this article:LUO Dan,LI Tun,CHEN Liqian, et al. Grammar-based Fuzz Testing for Microprocessor RTL Design[OL].[24 September 2021] http://en.paper.edu.cn/en_releasepaper/content/4755578


	2. A recommendation approach based on tensor for multi-criteria rating system
	Yang Jingting,Yuan Hanning,Wang Shuliang,Wang ShaoPeng
	Computer Science and Technology 26 May 2017
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Now users are encouraged to provide multiple criteria ratings for items which can be used to improve recommendation accuracy. However most model-based recommendation approaches for multi-criteria rating system don't provide straight- forward and effective way for integrating multi-criteria rating information into the model. In this research, a new recommendation method based on tensor is proposed to represent and fuse multi-criteria rating information effectively. In this approach, user-item-criteria representation model based on three-order tensor enables a generic integration of multi-criteria rating information and canonical poly based decomposition model is used to predict ratings in scenarios of highly sparse data. Experimental results on real world dataset show that the proposed method consistently improve recommendation accuracy for multi-criteria rating system in relation to effectively fusing multi-criteria rating information.
	TO cite this article:Yang Jingting,Yuan Hanning,Wang Shuliang, et al. A recommendation approach based on tensor for multi-criteria rating system[OL].[26 May 2017] http://en.paper.edu.cn/en_releasepaper/content/4735085

Saved Papers

Saved Papers


	3. Combinatorial Strategy in Fuzz Testing
	Kai Zhao,Hua Zhang,Qiaoyan Wen
	Computer Science and Technology 23 December 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:For the purpose of fuzzing more than one field per iteration in fuzz testing, in this paper, we present Combinatorial strategy which fuzzs more than one field at a time. This strategy traverses all the combinations of fields. Each fields has it's corresponding mutations and it will fuzz every combinations one by one until all possible mutations have been exhausted. However, combinatorial explosion follows with the Combinatorial strategy. Analyzing the relations of fields which can reduce the combinations of fields is one way to avoid the problem. Manually setting the max number of iterations of each combinations can evidently reduce the total number of iterations which might sacrifice some flaws. Experiment indicates that Combinatorial strategy not only effectively generates iterations but also can avoid the combinatorial explosion to a certain extent.
	TO cite this article:Kai Zhao,Hua Zhang,Qiaoyan Wen. Combinatorial Strategy in Fuzz Testing[OL].[23 December 2014] http://en.paper.edu.cn/en_releasepaper/content/4622619


	4. A Tool for Testing Java Memory Leaks
	DANG Wanchun,QIAN Ju,ZHOU Xiaoyu
	Computer Science and Technology 21 August 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Even with a built-in garbage collector, Java programs still suffer from memory leak problems caused by useless references to stale objects. Lots of researches have been conducted for the diagnosing of leaking failures. However, testing and identifying the leaking runs, which act as key steps before diagnosing, are still challenging. In this paper, we introduce a leak specification tool named LeakSpec to help programmers test memory leaks in Java programs. The specification works as a test oracle to automatically determine whether a program suffers from memory leaks. Users can write their own leak specifications using our specification language. LeakSpec weaves the specification checking mechanisms into the tested programs. During test runs, a memory leak failure will be reported if the some specifications are not satisfied. With this specification-based approach, a tester does not need to manually watch the program executions to identify memory leaks. The automatically reporting of memory leaks can reduce the manual efforts in leak testing. We test the proposed approach on ArgoUML. The results show that it is effective.?????
	TO cite this article:DANG Wanchun,QIAN Ju,ZHOU Xiaoyu. A Tool for Testing Java Memory Leaks[OL].[21 August 2014] http://en.paper.edu.cn/en_releasepaper/content/4606824


	5. Quantitative Analysis of Multiple-Component Software Defects
	LI Zu-De, CHEN Ming
	Computer Science and Technology 05 August 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Certain vital-few defects affect system qualities and maintenance costs more adversely than do other defects.%Identifying the vital-few defects and quantifying their characteristics offer the potential to guide defect correction and prevention.This study finds out that multiple-component defects (MCDs), defects spanning multiple system components, are such defects.Two case studies were conducted in six software systems for drawing a quantitative MCD profile, in aspects of defect proportion, distribution, complexity, longevity, and correction effort.The findings show typically that an MCD is likely to cross software development phase or release boundary 5-8 times more than a non-MCD defect.The profile can aid software maintenance and quality improvement.For example, more regression testing efforts shall be focused on MCDs because they tend to leak into subsequent phases or releases.
	TO cite this article:LI Zu-De, CHEN Ming. Quantitative Analysis of Multiple-Component Software Defects[OL].[ 5 August 2014] http://en.paper.edu.cn/en_releasepaper/content/4602929


	6. Research on the Realization Method of Workflow Engine in Enterprise Information Management
	Qiu Xiaoping ,Gangqiao Shi,Changlin Song,Yang Xu
	Computer Science and Technology 08 January 2013
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, a feasible realization method of workflow engine is discussed in detailed for enterprise information management on the basis of database technology. Under the guidance of workflow management Coalition (WfMC), the data model of workflow engine is presented firstly based on the process model given, in which the attributes of process, activity and its relationships with role, application, workflow relation data and transfer condition are marked out. And then the basic control principles of workflow engine are designed based on the necessary tables of process instances and activity instances, in which the control method of process instance and activity instance are discussed in detail including the creation, startup, management or status evolvement of the instance. In our research work, this workflow engine is programmed as this realization method successfully on the development platform of SQL server 2000 and Visual Studio 2005 and the results shows the effectiveness of the workflow engine for inventory information management. Our achievements give a feasible realization method for business process management in enterprise using the advanced workflow technology, which can assign the good flexibility to the information management and improve the whole performance of enterprise while facing the changing market requirements.
	TO cite this article:Qiu Xiaoping ,Gangqiao Shi,Changlin Song, et al. Research on the Realization Method of Workflow Engine in Enterprise Information Management[J].


	7. Schedulability Analysis for Mode Changes in AFDX Network
	Lu Xiaoyuan,Li Jian,Hu Fei
	Computer Science and Technology 18 December 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Avionics Full Duplex Switched Ethernet (AFDX) is a new communication standard for an Aircraft Data Network. AFDX networks are used in safety-critical applications that require dedicated bandwidth and provides deterministic Quality of Service (QoS). An aircraft system based on an AFDX network must have the ability to change its functionality over time by means of a mode change. Therefore, it is very important to guarantee the timing requirements in every steady mode, and also during the transition between two different modes. In this paper, a mode change request (MCR) is defined as a sporadic event which triggers a change from one mode to another mode. A Basic Mode Change Model is first described for an AFDX network in order to analyze schedulability of mutual data flows. Then schedulability analysis is done using the proposed model by computing worst case response time for the data flow.
	TO cite this article:Lu Xiaoyuan,Li Jian,Hu Fei. Schedulability Analysis for Mode Changes in AFDX Network[OL].[18 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4500982


	8. An End User Oriented Method for Web based Mashups
	He Yangfan
	Computer Science and Technology 10 December 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Web resouces can not predicate all possible usage of the web resources.Mashuping the data from different origins with the wisdom is an important way to reuse the web resources and uncover more new ways to use them. The paper proposes a novel method which targetted at utilizing the crowd's wisdom to create mashups. The key issuese investigated in the paper include:(1) how to express and analyze the user's initial requirement;(2)how to evaluate the end user expert's ability to fulfill a mashup task.(3)how to generate a roadmap for the mashup task. The rational of the method is explained and a typical workflow example is given to show the usage of the method.
	TO cite this article:He Yangfan . An End User Oriented Method for Web based Mashups[OL].[10 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4500214


	9. ESHMP: A Stall-Time-Based Scheduling for Performance Heterogeneous Multicore Systems
	Nie Pengcheng,Duan Zhenhua
	Computer Science and Technology 18 February 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Performance heterogeneous multicore processors (HMP for short), whichconsist of multiple cores with the same instruction set but different performance characteristics (e.g., clock speed, issue width), are of great concern for their ability to deliver higher performance per watt and area for programs with diverse architectural requirements than comparable homogeneous ones. However, such power and area efficiencies of performance heterogeneous multicore systems can only be achieved when workloads are emph{matched} with cores according to the properties of the workload and features of the core.In this paper, we propose a new metric, ASTPI (Average Stall Time per Instruction), to measure the efficiencies of threads in using fast cores. We design, implement and evaluate a new online monitoring approach called ESHMP, which is based on the metric. Our evaluation in the Linux 2.6.21 operating system shows that ESHMP delivers scalability while adapting to a wide variety of applications. Also, our experiment results show that among HMP systems in which heterogeneity-aware schedulers are adopted and there are more than one LLC (Last Level Cache), the architectures where heterogeneous cores share LLCs gain better performance than the ones where homogeneous cores share LLCs.
	TO cite this article:Nie Pengcheng,Duan Zhenhua. ESHMP: A Stall-Time-Based Scheduling for Performance Heterogeneous Multicore Systems[OL].[18 February 2012] http://en.paper.edu.cn/en_releasepaper/content/4463796


	10. Refining Graph Partitioning for Community Detection
	Qian Tieyun,Yang Yang,Wang Shuo
	Computer Science and Technology 29 September 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Graph partitioning is traditionally designed for dividing the vertices into clusters such that a predefined quality function, for example, normalized cut or ratio cut, is approximately optimized. Recently, demand for social network analysis arouses the new research interest on graph clustering with no constraint on the size of partitions. Social network exhibits some key properties such as power-law and small-world. This paper presents a new definition for measuring the small world weight between two vertices, then a refinement strategy is designed for improving results obtained by traditional graph partitioning algorithm. Experimental evaluation demonstrates that the proposed algorithm can effectively enhance the objective functions.
	TO cite this article:Qian Tieyun,Yang Yang,Wang Shuo. Refining Graph Partitioning for Community Detection[OL].[29 September 2010] http://en.paper.edu.cn/en_releasepaper/content/4387034

	Check out RSS, or use RSS reader to subscribe this item