Unique fixpoint induction for value-passing processes

J. Rathke
{"title":"Unique fixpoint induction for value-passing processes","authors":"J. Rathke","doi":"10.1109/LICS.1997.614942","DOIUrl":null,"url":null,"abstract":"We investigate the use of unique fixpoint induction as a proof method for value-passing process languages with recursion. An intuitive generalisation of unique fixpoint induction based on loop invariants for symbolic graphs yields strong completeness results; we give an axiomatic characterisation of both late and early observational congruence for a class of fully parameterised processes. This new, generalised, rule is shown to be derivable from existing formulations of unique fixpoint induction for value-passing calculi, thereby providing original completeness results. An example of the use of this new rule is presented in detail.","PeriodicalId":272903,"journal":{"name":"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1997.614942","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

We investigate the use of unique fixpoint induction as a proof method for value-passing process languages with recursion. An intuitive generalisation of unique fixpoint induction based on loop invariants for symbolic graphs yields strong completeness results; we give an axiomatic characterisation of both late and early observational congruence for a class of fully parameterised processes. This new, generalised, rule is shown to be derivable from existing formulations of unique fixpoint induction for value-passing calculi, thereby providing original completeness results. An example of the use of this new rule is presented in detail.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
值传递过程的唯一不动点归纳
我们研究了使用唯一不动点归纳法作为递归值传递过程语言的证明方法。基于循环不变量的符号图唯一不动点归纳法的一个直观推广得到了强完备性结果。我们给出了一类全参数化过程的早期和晚期观测同余的公理化性质。这个新的、推广的规则可以从已有的值传递演算的唯一不动点归纳法推导出来,从而提供了原始的完备性结果。详细介绍了使用该新规则的一个示例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Believe it or not, AJM's games model is a model of classical linear logic Discrimination by parallel observers Semantics of exact real arithmetic Unique fixpoint induction for value-passing processes The monadic quantifier alternation hierarchy over graphs is infinite
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1