指定数据共享协议

Vipin Swarup, Leonard J. Seligman, A. Rosenthal
{"title":"指定数据共享协议","authors":"Vipin Swarup, Leonard J. Seligman, A. Rosenthal","doi":"10.1109/POLICY.2006.34","DOIUrl":null,"url":null,"abstract":"When consumers build value-added services on top of data resources they do not control, they need to manage their information supply chains to ensure that their data suppliers produce and supply required data as needed. Producers also need to manage their information supply chains to ensure that their data is disseminated and protected appropriately. In this paper, we present a novel model for data sharing agreements that supports a wide variety of data sharing policies. The model is based on distributed temporal logic (DTL) predicates that are expressed over events in dataflow graphs. A dataflow graph's nodes are principals with local stores, and its edges are (typed) channels along which dataflows. We illustrate the model via examples and discuss the kinds of analyses enabled by the model","PeriodicalId":169233,"journal":{"name":"Seventh IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'06)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"Specifying data sharing agreements\",\"authors\":\"Vipin Swarup, Leonard J. Seligman, A. Rosenthal\",\"doi\":\"10.1109/POLICY.2006.34\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When consumers build value-added services on top of data resources they do not control, they need to manage their information supply chains to ensure that their data suppliers produce and supply required data as needed. Producers also need to manage their information supply chains to ensure that their data is disseminated and protected appropriately. In this paper, we present a novel model for data sharing agreements that supports a wide variety of data sharing policies. The model is based on distributed temporal logic (DTL) predicates that are expressed over events in dataflow graphs. A dataflow graph's nodes are principals with local stores, and its edges are (typed) channels along which dataflows. We illustrate the model via examples and discuss the kinds of analyses enabled by the model\",\"PeriodicalId\":169233,\"journal\":{\"name\":\"Seventh IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'06)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Seventh IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/POLICY.2006.34\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Seventh IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/POLICY.2006.34","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

摘要

当消费者在他们无法控制的数据资源之上构建增值服务时,他们需要管理他们的信息供应链,以确保他们的数据供应商根据需要生产和提供所需的数据。生产者还需要管理其信息供应链,以确保其数据得到适当的传播和保护。在本文中,我们提出了一个支持多种数据共享策略的数据共享协议的新模型。该模型基于分布式时间逻辑(DTL)谓词,这些谓词在数据流图中的事件上表示。数据流图的节点是具有本地存储的主体,其边缘是数据流沿着的(类型化的)通道。我们通过示例说明该模型,并讨论该模型支持的各种分析
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Specifying data sharing agreements
When consumers build value-added services on top of data resources they do not control, they need to manage their information supply chains to ensure that their data suppliers produce and supply required data as needed. Producers also need to manage their information supply chains to ensure that their data is disseminated and protected appropriately. In this paper, we present a novel model for data sharing agreements that supports a wide variety of data sharing policies. The model is based on distributed temporal logic (DTL) predicates that are expressed over events in dataflow graphs. A dataflow graph's nodes are principals with local stores, and its edges are (typed) channels along which dataflows. We illustrate the model via examples and discuss the kinds of analyses enabled by the model
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信