Using machine learning clustering to find large coverage holes

2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Identifying large and important coverage holes is a time-consuming process that requires expertise in the design and its verification environment. This paper describes a novel machine learning-based technique for finding large coverage holes when the coverage events are individually defined. The technique is based on clustering the events according to their names and mapping the clusters into cross-products. Our proposed technique is being used in the verification of high-end servers. It has already improved the quality of coverage analysis and helped identify several environment problems.

Cite

CITATION STYLE

APA

Gal, R., Simchoni, G., & Ziv, A. (2020). Using machine learning clustering to find large coverage holes. In MLCAD 2020 - Proceedings of the 2020 ACM/IEEE Workshop on Machine Learning for CAD (pp. 139–144). Association for Computing Machinery, Inc. https://doi.org/10.1145/3380446.3430621

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free