{"title":"Finding Glitches Using Formal Methods","authors":"Yan Peng, I. W. Jones, M. Greenstreet","doi":"10.1109/ASYNC.2016.12","DOIUrl":null,"url":null,"abstract":"The increasing scale and complexity of integrated circuits leads to many departures from a pure, synchronous design methodology. Clock-domain crossings, multi-cycle paths, and circuits for test with long combinational logic delays introduce vulnerabilities for glitch-related failures. Conventional simulation techniques can miss glitches because of the large number of value and timing scenarios. We have tried several commercially available tools but have not found a comprehensive solution. This paper presents a concise statement of what it means for a logic circuit to be \"glitch free\". This property can be verified using satisfiability solvers. We present our implementation using the ACL2 theorem proving system and some experimental results.","PeriodicalId":314538,"journal":{"name":"2016 22nd IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC)","volume":"968 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 22nd IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASYNC.2016.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
The increasing scale and complexity of integrated circuits leads to many departures from a pure, synchronous design methodology. Clock-domain crossings, multi-cycle paths, and circuits for test with long combinational logic delays introduce vulnerabilities for glitch-related failures. Conventional simulation techniques can miss glitches because of the large number of value and timing scenarios. We have tried several commercially available tools but have not found a comprehensive solution. This paper presents a concise statement of what it means for a logic circuit to be "glitch free". This property can be verified using satisfiability solvers. We present our implementation using the ACL2 theorem proving system and some experimental results.