Pub Date : 2004-11-10DOI: 10.1109/HLDVT.2004.1431220
Chia-Chih Yen, Jing-Yang Jou
We present an effective algorithm to enhance sequential depth computation. The sequential depth plays the most crucial role to the completeness of bounded model checking. Previous work computes the sequential depth by exhaustively searching the state space, which is unable to keep pace with the exponential growth of design complexity. To improve the computation, we develop an efficient approach that takes the branch-and-bound manner. We reduce the search space by applying a partitioning as well as a pruning method. Furthermore, we propose a novel formulation and integrate the techniques of BDDs and SAT solvers to search states that determine the sequential depth. Experimental results show that our approach considerably enhances the performance compared with the results of the previous work.
{"title":"Enhancing sequential depth computation with a branch-and-bound algorithm","authors":"Chia-Chih Yen, Jing-Yang Jou","doi":"10.1109/HLDVT.2004.1431220","DOIUrl":"https://doi.org/10.1109/HLDVT.2004.1431220","url":null,"abstract":"We present an effective algorithm to enhance sequential depth computation. The sequential depth plays the most crucial role to the completeness of bounded model checking. Previous work computes the sequential depth by exhaustively searching the state space, which is unable to keep pace with the exponential growth of design complexity. To improve the computation, we develop an efficient approach that takes the branch-and-bound manner. We reduce the search space by applying a partitioning as well as a pruning method. Furthermore, we propose a novel formulation and integrate the techniques of BDDs and SAT solvers to search states that determine the sequential depth. Experimental results show that our approach considerably enhances the performance compared with the results of the previous work.","PeriodicalId":240214,"journal":{"name":"Proceedings. Ninth IEEE International High-Level Design Validation and Test Workshop (IEEE Cat. No.04EX940)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133188018","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：