{"title":"从高层次微处理器的正式验证的新一代ISCAS基准","authors":"M. Velev","doi":"10.1109/ISCAS.2004.1329500","DOIUrl":null,"url":null,"abstract":"The paper presents a collection of 20 benchmark suites with a total of 1,132 ISCAS Boolean formulas from formal verification of high-level microprocessors, including pipelined, superscalar, and VLIW models with exceptions, multicycle functional units, branch prediction, instruction queues, and register renaming. These benchmarks can be used in research on testing, logic synthesis and optimization, equivalence verification, decision diagrams, and Boolean satisfiability. The most complex formulas have more than 700,000 logic gates.","PeriodicalId":6445,"journal":{"name":"2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)","volume":"11 1","pages":"V-V"},"PeriodicalIF":0.0000,"publicationDate":"2004-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A new generation of ISCAS benchmarks from formal verification of high-level microprocessors\",\"authors\":\"M. Velev\",\"doi\":\"10.1109/ISCAS.2004.1329500\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper presents a collection of 20 benchmark suites with a total of 1,132 ISCAS Boolean formulas from formal verification of high-level microprocessors, including pipelined, superscalar, and VLIW models with exceptions, multicycle functional units, branch prediction, instruction queues, and register renaming. These benchmarks can be used in research on testing, logic synthesis and optimization, equivalence verification, decision diagrams, and Boolean satisfiability. The most complex formulas have more than 700,000 logic gates.\",\"PeriodicalId\":6445,\"journal\":{\"name\":\"2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)\",\"volume\":\"11 1\",\"pages\":\"V-V\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCAS.2004.1329500\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCAS.2004.1329500","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new generation of ISCAS benchmarks from formal verification of high-level microprocessors
The paper presents a collection of 20 benchmark suites with a total of 1,132 ISCAS Boolean formulas from formal verification of high-level microprocessors, including pipelined, superscalar, and VLIW models with exceptions, multicycle functional units, branch prediction, instruction queues, and register renaming. These benchmarks can be used in research on testing, logic synthesis and optimization, equivalence verification, decision diagrams, and Boolean satisfiability. The most complex formulas have more than 700,000 logic gates.