用代数方法证明微程序

MICRO 9 Pub Date : 1976-09-27 DOI:10.1145/800145.804779

A. Blikle, S. Budkowski

{"title":"用代数方法证明微程序","authors":"A. Blikle, S. Budkowski","doi":"10.1145/800145.804779","DOIUrl":null,"url":null,"abstract":"This algebraic method provides a mathematical framework for proving input-output properties (such as partial and total correctness) of iterative programs. Technically it uses a calculus of binary relations extended with fixed-point equations. The method has been tested on several microprograms of a computer's arithmetical unit. One example of such a microprogram and its correctness proof is discussed in the paper.","PeriodicalId":202585,"journal":{"name":"MICRO 9","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1976-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Certification of microprograms by an algebraic method\",\"authors\":\"A. Blikle, S. Budkowski\",\"doi\":\"10.1145/800145.804779\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This algebraic method provides a mathematical framework for proving input-output properties (such as partial and total correctness) of iterative programs. Technically it uses a calculus of binary relations extended with fixed-point equations. The method has been tested on several microprograms of a computer's arithmetical unit. One example of such a microprogram and its correctness proof is discussed in the paper.\",\"PeriodicalId\":202585,\"journal\":{\"name\":\"MICRO 9\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1976-09-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MICRO 9\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800145.804779\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MICRO 9","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800145.804779","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

这种代数方法为证明迭代程序的输入-输出特性(如部分和全部正确性)提供了一个数学框架。从技术上讲，它使用了用不动点方程扩展的二元关系演算。该方法已在计算机算术单元的几个微程序上进行了测试。文中给出了该微程序的一个实例及其正确性证明。

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

查看原文本刊更多论文

Certification of microprograms by an algebraic method

This algebraic method provides a mathematical framework for proving input-output properties (such as partial and total correctness) of iterative programs. Technically it uses a calculus of binary relations extended with fixed-point equations. The method has been tested on several microprograms of a computer's arithmetical unit. One example of such a microprogram and its correctness proof is discussed in the paper.

求助全文

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

来源期刊

MICRO 9

自引率

0.00%

发文量