{"title":"语法导向的while程序的动态特性分析","authors":"Krzysztof R. Apt, Carole Delporte-Gallet","doi":"10.1016/S0019-9958(86)80037-7","DOIUrl":null,"url":null,"abstract":"<div><p>A syntax directed proof system which allows to prove <em>liveness</em> properties of <strong>while</strong>-programs is introduced. The proof system is proved to be arithmetically sound and complete in the sense of <span>Harel (“Lecture Notes in Comput. Sci. Vol. 68,” Springer-Verlag, Berlin/New York, 1979)</span>. The results of the paper generalize a corresponding result <span>Pneuli (“Prc. 18th Sympos. FOCS” IEEE, Providence, R. I., 1977)</span> proves for unstructured programs. The proof system decomposes into two parts. The first part allows to prove simple <em>safety</em> properties. These properties are used as axioms in the second proof system which deals with <em>liveness</em> properties. The completeness proof is constructive and provides a heuristic for proving specific liveness properties.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1986-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80037-7","citationCount":"3","resultStr":"{\"title\":\"Syntax directed analysis of liveness properties of while programs\",\"authors\":\"Krzysztof R. Apt, Carole Delporte-Gallet\",\"doi\":\"10.1016/S0019-9958(86)80037-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>A syntax directed proof system which allows to prove <em>liveness</em> properties of <strong>while</strong>-programs is introduced. The proof system is proved to be arithmetically sound and complete in the sense of <span>Harel (“Lecture Notes in Comput. Sci. Vol. 68,” Springer-Verlag, Berlin/New York, 1979)</span>. The results of the paper generalize a corresponding result <span>Pneuli (“Prc. 18th Sympos. FOCS” IEEE, Providence, R. I., 1977)</span> proves for unstructured programs. The proof system decomposes into two parts. The first part allows to prove simple <em>safety</em> properties. These properties are used as axioms in the second proof system which deals with <em>liveness</em> properties. The completeness proof is constructive and provides a heuristic for proving specific liveness properties.</p></div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80037-7\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995886800377\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995886800377","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 3
摘要
介绍了一种语法导向证明系统，该系统可以证明while程序的活动性。证明系统在数学上是健全的，在哈雷尔(“计算机讲义”)的意义上是完整的。科学。第68卷，“施普林格出版社，柏林/纽约，1979年)。本文的结果推广了Pneuli (Prc)的一个相应结果。18 Sympos。FOCS (IEEE, Providence, R. I.， 1977)证明非结构化程序。证明制度分为两部分。第一部分允许证明简单的安全属性。这些性质在处理活性性质的第二证明系统中用作公理。完备性证明是建设性的，为证明特定的活性性质提供了启发式的方法。
Syntax directed analysis of liveness properties of while programs
A syntax directed proof system which allows to prove liveness properties of while-programs is introduced. The proof system is proved to be arithmetically sound and complete in the sense of Harel (“Lecture Notes in Comput. Sci. Vol. 68,” Springer-Verlag, Berlin/New York, 1979). The results of the paper generalize a corresponding result Pneuli (“Prc. 18th Sympos. FOCS” IEEE, Providence, R. I., 1977) proves for unstructured programs. The proof system decomposes into two parts. The first part allows to prove simple safety properties. These properties are used as axioms in the second proof system which deals with liveness properties. The completeness proof is constructive and provides a heuristic for proving specific liveness properties.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
