设计可执行的抽象

Formal Methods in Software Practice Pub Date : 1998-03-04 DOI:10.1145/298595.298864

G. Holzmann

{"title":"设计可执行的抽象","authors":"G. Holzmann","doi":"10.1145/298595.298864","DOIUrl":null,"url":null,"abstract":"1. ABSTRACT It is well-known that in general the problem of deciding whether a program halts (or can deadlock) is undecidable. Model checkers, therefore, cannot be applied to arbitrary programs, but work with well-defined abstractions of programs. The feasibility of a verification often depends on the type of abstraction that is made. Abstraction is indeed the most powerful tool that the user of a model checking tool can apply, yet it is often perceived as a temporary inconvenience.","PeriodicalId":125560,"journal":{"name":"Formal Methods in Software Practice","volume":"3 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":"{\"title\":\"Designing executable abstractions\",\"authors\":\"G. Holzmann\",\"doi\":\"10.1145/298595.298864\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"1. ABSTRACT It is well-known that in general the problem of deciding whether a program halts (or can deadlock) is undecidable. Model checkers, therefore, cannot be applied to arbitrary programs, but work with well-defined abstractions of programs. The feasibility of a verification often depends on the type of abstraction that is made. Abstraction is indeed the most powerful tool that the user of a model checking tool can apply, yet it is often perceived as a temporary inconvenience.\",\"PeriodicalId\":125560,\"journal\":{\"name\":\"Formal Methods in Software Practice\",\"volume\":\"3 4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-03-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"26\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Formal Methods in Software Practice\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/298595.298864\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Formal Methods in Software Practice","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/298595.298864","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 26

摘要

1. 众所周知，一般来说，决定程序是否停止(或是否会死锁)的问题是无法确定的。因此，模型检查器不能应用于任意程序，而是与定义良好的程序抽象一起工作。验证的可行性通常取决于所做的抽象的类型。抽象确实是模型检查工具的用户可以应用的最强大的工具，但是它经常被认为是暂时的不便。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Designing executable abstractions

1. ABSTRACT It is well-known that in general the problem of deciding whether a program halts (or can deadlock) is undecidable. Model checkers, therefore, cannot be applied to arbitrary programs, but work with well-defined abstractions of programs. The feasibility of a verification often depends on the type of abstraction that is made. Abstraction is indeed the most powerful tool that the user of a model checking tool can apply, yet it is often perceived as a temporary inconvenience.

求助全文

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

来源期刊

Formal Methods in Software Practice

自引率

0.00%

发文量

期刊最新文献

Using TAME to prove invariants of automata models: Two case studies Using predicate abstraction to reduce object-oriented programs for model checking Software synthesis and applications (abstract only) Formal modeling of active network nodes using PVS DSD: A schema language for XML