Contract-Oriented Computing in CO2

Massimo Bartoletti, E. Tuosto, R. Zunino
{"title":"Contract-Oriented Computing in CO2","authors":"Massimo Bartoletti, E. Tuosto, R. Zunino","doi":"10.7561/SACS.2012.1.5","DOIUrl":null,"url":null,"abstract":"We present CO2 , a parametric calculus for contract-based computing in distributed systems. By abstracting from the actual contract language, our calculus generalises both the contracts-as-processes and contracts-as-formulae paradigms. The calculus features primitives for advertising contracts, for reaching agreements, and for querying the fulfilment of contracts. Coordination among participants happens via multi-party sessions, which are created once agreements are reached. We present two instances of our calculus, by modelling contracts as processes in a variant of CCS, and as formulae in a logic. We formally relate the two paradigms, through an encoding from contracts-as-formulae to contracts-as-processes which ensures that the promises deducible in the logical system are exactly those reachable by its encoding as a process. Finally, we present a coarse-grained taxonomy of possible misbehaviours in contract-oriented systems, and we illustrate them with the help of a variety of examples.","PeriodicalId":394919,"journal":{"name":"Sci. Ann. Comput. Sci.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sci. Ann. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7561/SACS.2012.1.5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 31

Abstract

We present CO2 , a parametric calculus for contract-based computing in distributed systems. By abstracting from the actual contract language, our calculus generalises both the contracts-as-processes and contracts-as-formulae paradigms. The calculus features primitives for advertising contracts, for reaching agreements, and for querying the fulfilment of contracts. Coordination among participants happens via multi-party sessions, which are created once agreements are reached. We present two instances of our calculus, by modelling contracts as processes in a variant of CCS, and as formulae in a logic. We formally relate the two paradigms, through an encoding from contracts-as-formulae to contracts-as-processes which ensures that the promises deducible in the logical system are exactly those reachable by its encoding as a process. Finally, we present a coarse-grained taxonomy of possible misbehaviours in contract-oriented systems, and we illustrate them with the help of a variety of examples.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
CO2中面向契约的计算
我们提出了CO2,一个用于分布式系统中基于契约的计算的参数演算。通过从实际的合同语言中抽象出来,我们的演算概括了合同作为过程和合同作为公式的范式。微积分以广告合同、达成协议和查询合同履行的原语为特征。参与者之间的协调是通过多方会议进行的,一旦达成协议,就会创建多方会议。我们通过将契约建模为CCS的一种变体过程,并将其作为逻辑中的公式,提出了我们演算的两个实例。我们将这两个范式形式化地联系起来,通过从契约作为公式到契约作为过程的编码,确保逻辑系统中可演绎的承诺正是通过其编码作为过程可达到的承诺。最后,我们提出了面向契约的系统中可能的错误行为的粗粒度分类,并通过各种示例来说明它们。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Describing weighted safety with weighted LTL over product omega-valuation monoids On Nirmala Indices of Some Hex-derived Networks of Type Three and Their Subdivision Networks Shrinkage Estimators for the Intercept in Linear and Uplift Regression A Teacher of Great Strengths Maximal Existential and Universal Width
×
引用
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