树形进位加法器的形式化验证

Proceedings Ninth Great Lakes Symposium on VLSI Pub Date : 1999-03-04 DOI:10.1109/GLSV.1999.757419

Sae Hwan Kim, Shiu-Kai Chin

{"title":"树形进位加法器的形式化验证","authors":"Sae Hwan Kim, Shiu-Kai Chin","doi":"10.1109/GLSV.1999.757419","DOIUrl":null,"url":null,"abstract":"Quad trees-trees with four branches, are used to abstractly describe tree-structured carry-lookahead adders using 4-bit components. The specification and implementation descriptions are parametrized and tree-structured adders having arbitrarily large inputs and outputs are described. The descriptions are formally verified using the HOL theorem power.","PeriodicalId":127222,"journal":{"name":"Proceedings Ninth Great Lakes Symposium on VLSI","volume":"233 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Formal verification of tree-structured carry-lookahead adders\",\"authors\":\"Sae Hwan Kim, Shiu-Kai Chin\",\"doi\":\"10.1109/GLSV.1999.757419\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Quad trees-trees with four branches, are used to abstractly describe tree-structured carry-lookahead adders using 4-bit components. The specification and implementation descriptions are parametrized and tree-structured adders having arbitrarily large inputs and outputs are described. The descriptions are formally verified using the HOL theorem power.\",\"PeriodicalId\":127222,\"journal\":{\"name\":\"Proceedings Ninth Great Lakes Symposium on VLSI\",\"volume\":\"233 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-03-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Ninth Great Lakes Symposium on VLSI\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLSV.1999.757419\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Ninth Great Lakes Symposium on VLSI","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLSV.1999.757419","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

四叉树-具有四个分支的树，用于抽象地描述使用4位组件的树结构进位加法器。规范和实现描述是参数化的，描述了具有任意大输入和输出的树状结构加法器。利用HOL定理的幂对这些描述进行了形式化验证。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Formal verification of tree-structured carry-lookahead adders

Quad trees-trees with four branches, are used to abstractly describe tree-structured carry-lookahead adders using 4-bit components. The specification and implementation descriptions are parametrized and tree-structured adders having arbitrarily large inputs and outputs are described. The descriptions are formally verified using the HOL theorem power.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings Ninth Great Lakes Symposium on VLSI

自引率

0.00%

发文量