{"title":"模型检查单元库的Verilog描述","authors":"M. Raffelsieper, J. Roorda, M. Mousavi","doi":"10.1109/ACSD.2009.18","DOIUrl":null,"url":null,"abstract":"We present a formal semantics for a subset of Verilog, commonly used todescribe cell libraries, in terms of transition systems.Such transition systems can serve as input to symbolic model checking,for example equivalence checking with a transistor netlist description. Weimplement our formal semantics as an encoding from the subset of Verilog tothe input language of the SMV model-checker.Experiments show that this approach is able to verify complete cell libraries.","PeriodicalId":307821,"journal":{"name":"2009 Ninth International Conference on Application of Concurrency to System Design","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Model Checking Verilog Descriptions of Cell Libraries\",\"authors\":\"M. Raffelsieper, J. Roorda, M. Mousavi\",\"doi\":\"10.1109/ACSD.2009.18\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a formal semantics for a subset of Verilog, commonly used todescribe cell libraries, in terms of transition systems.Such transition systems can serve as input to symbolic model checking,for example equivalence checking with a transistor netlist description. Weimplement our formal semantics as an encoding from the subset of Verilog tothe input language of the SMV model-checker.Experiments show that this approach is able to verify complete cell libraries.\",\"PeriodicalId\":307821,\"journal\":{\"name\":\"2009 Ninth International Conference on Application of Concurrency to System Design\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Ninth International Conference on Application of Concurrency to System Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSD.2009.18\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Ninth International Conference on Application of Concurrency to System Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSD.2009.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Model Checking Verilog Descriptions of Cell Libraries
We present a formal semantics for a subset of Verilog, commonly used todescribe cell libraries, in terms of transition systems.Such transition systems can serve as input to symbolic model checking,for example equivalence checking with a transistor netlist description. Weimplement our formal semantics as an encoding from the subset of Verilog tothe input language of the SMV model-checker.Experiments show that this approach is able to verify complete cell libraries.