基于构件的容错程序力学验证案例研究

Proceedings 19th IEEE International Conference on Distributed Computing Systems Pub Date : 1999-06-05 DOI:10.1109/SLFSTB.1999.777484

S. Kulkarni, J. Rushby, N. Shankar

{"title":"基于构件的容错程序力学验证案例研究","authors":"S. Kulkarni, J. Rushby, N. Shankar","doi":"10.1109/SLFSTB.1999.777484","DOIUrl":null,"url":null,"abstract":"We present a case study to demonstrate that the decomposition of a fault tolerant program into its components is useful in its mechanical verification. More specifically we discuss our experience in using the theorem prover PVS to verify Dijkstra's token ring program in a component based manner. We also demonstrate the advantages of component based mechanical verification.","PeriodicalId":395768,"journal":{"name":"Proceedings 19th IEEE International Conference on Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"34","resultStr":"{\"title\":\"A case-study in component-based mechanical verification of fault-tolerant programs\",\"authors\":\"S. Kulkarni, J. Rushby, N. Shankar\",\"doi\":\"10.1109/SLFSTB.1999.777484\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a case study to demonstrate that the decomposition of a fault tolerant program into its components is useful in its mechanical verification. More specifically we discuss our experience in using the theorem prover PVS to verify Dijkstra's token ring program in a component based manner. We also demonstrate the advantages of component based mechanical verification.\",\"PeriodicalId\":395768,\"journal\":{\"name\":\"Proceedings 19th IEEE International Conference on Distributed Computing Systems\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"34\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 19th IEEE International Conference on Distributed Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SLFSTB.1999.777484\",\"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 19th IEEE International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SLFSTB.1999.777484","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 34

摘要

我们提出了一个案例研究，以证明将容错程序分解为其组件在其机械验证中是有用的。更具体地说，我们讨论了我们使用定理证明器PVS以基于组件的方式验证Dijkstra的令牌环程序的经验。我们还展示了基于构件的力学验证的优点。

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

查看原文本刊更多论文

A case-study in component-based mechanical verification of fault-tolerant programs

We present a case study to demonstrate that the decomposition of a fault tolerant program into its components is useful in its mechanical verification. More specifically we discuss our experience in using the theorem prover PVS to verify Dijkstra's token ring program in a component based manner. We also demonstrate the advantages of component based mechanical verification.

求助全文

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

来源期刊

Proceedings 19th IEEE International Conference on Distributed Computing Systems

自引率

0.00%

发文量