Leads-to Properties and the But-not-yet Operator.pdf

Leads-to Properties and the But-not-yet Operator.pdf

  1. 1、本文档共13页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Leads-to Properties and the But-not-yet Operator

Leads-to Properties andthe But-not-yet OperatorKen CalvertCollege of ComputingGeorgia Institute of TechnologyAtlanta, Georgia 30032-0280calvert@cc.gatech.eduGIT{CC{93/60October 1993AbstractWe de ne a predicate transformer, in terms of which nite disjunctions of leads-toproperties can be rewritten as single leads-to properties. Although disjunctions ofleads-to properties do not typically arise naturally in progress speci cations, anexample shows how they may be introduced through the use of nested implica-tions of leads-to properties; such implications allow subtle dependencies between aprograms progress and that of its environment to be conveniently speci ed. Afterintroducing the predicate transformer, which is called the but-not-yet operator,we show how to de ne a single leads-to property equivalent to a given disjunctionof two leads-to properties. An alternative de nition of the but-not-yet operatoris shown to be equivalent to the rst, and some properties of the operator areproved. Finally, the predicate transformer is generalized to any nite number ofarguments. College of ComputingGeorgia Institute of TechnologyAtlanta, Georgia 30332{0280 1 IntroductionMany speci cation formalisms use some fragment of linear temporal logic to specify programproperties. In such formalisms, sequences of states represent the possible behaviors of aprogram. A temporal property is a predicate on sequences of states; a program satis es such aproperty P if and only if P is true for each sequence representing a possible program behaviors.In recent years it has been demonstrated that a wide range of properties useful in practicecan be speci ed using a few simple temporal forms [4, 5, 6, 7, 8].This paper considers a class of properties built up from basic temporal properties usingboolean connectives: the temporal predicate P ^Q is true for a sequence i both P and Q are;P _Q is true i either P or Q is, and P ) Q is true i either P is not true or Q is true. Thefamiliar laws of proposit

文档评论(0)

l215322 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档