Eman El Mandouh, A. Salem, Mennatallah Amer, A. Wassal
{"title":"Cross-product functional coverage analysis using machine learning clustering techniques","authors":"Eman El Mandouh, A. Salem, Mennatallah Amer, A. Wassal","doi":"10.1109/DTIS.2018.8368574","DOIUrl":null,"url":null,"abstract":"This work proposes the application of clustering machine learning to simplify functional coverage analysis. It introduces a two-round clustering algorithm to group the functional coverage goals that share similar cover items. In the first round, the associations between cover-crosses are encoded as a binary connectivity matrix. K-Means with Jaccard similarity is used to group highly correlated cover-crosses. In the second round, coverage ratio is used as the main measure to sub-group the clusters resulted from the first round. The resulted clusters are then analyzed to identify which cover-crosses mostly contribute to low coverage clusters. Dropping the number of cover-crosses to analyze into a limited number of representative buckets that can further be used by advanced analysis engines to help reach coverage closure faster.","PeriodicalId":328650,"journal":{"name":"2018 13th International Conference on Design & Technology of Integrated Systems In Nanoscale Era (DTIS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 13th International Conference on Design & Technology of Integrated Systems In Nanoscale Era (DTIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DTIS.2018.8368574","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
This work proposes the application of clustering machine learning to simplify functional coverage analysis. It introduces a two-round clustering algorithm to group the functional coverage goals that share similar cover items. In the first round, the associations between cover-crosses are encoded as a binary connectivity matrix. K-Means with Jaccard similarity is used to group highly correlated cover-crosses. In the second round, coverage ratio is used as the main measure to sub-group the clusters resulted from the first round. The resulted clusters are then analyzed to identify which cover-crosses mostly contribute to low coverage clusters. Dropping the number of cover-crosses to analyze into a limited number of representative buckets that can further be used by advanced analysis engines to help reach coverage closure faster.