并行约束规划的组合分析

M. Falaschi, M. Gabbrielli, K. Marriott, C. Palamidessi
{"title":"并行约束规划的组合分析","authors":"M. Falaschi, M. Gabbrielli, K. Marriott, C. Palamidessi","doi":"10.1109/LICS.1993.287586","DOIUrl":null,"url":null,"abstract":"A framework for the analysis of concurrent constraint programming (CCP) is proposed. The approach is based on simple denotational semantics that approximate the usual semantics in the sense that they give a superset of the input-output relation of a CCP program. Analyses based on these semantics can be easily and efficiently implemented using standard techniques from the analysis of logic programs.<<ETX>>","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"320 1","pages":"210-221"},"PeriodicalIF":0.0000,"publicationDate":"1993-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"50","resultStr":"{\"title\":\"Compositional analysis for concurrent constraint programming\",\"authors\":\"M. Falaschi, M. Gabbrielli, K. Marriott, C. Palamidessi\",\"doi\":\"10.1109/LICS.1993.287586\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A framework for the analysis of concurrent constraint programming (CCP) is proposed. The approach is based on simple denotational semantics that approximate the usual semantics in the sense that they give a superset of the input-output relation of a CCP program. Analyses based on these semantics can be easily and efficiently implemented using standard techniques from the analysis of logic programs.<<ETX>>\",\"PeriodicalId\":6322,\"journal\":{\"name\":\"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science\",\"volume\":\"320 1\",\"pages\":\"210-221\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"50\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.1993.287586\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1993.287586","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 50

摘要

提出了并发约束规划(CCP)的分析框架。该方法基于简单的指称语义,这种语义近似于通常的语义,因为它们给出了CCP程序的输入-输出关系的超集。基于这些语义的分析可以使用逻辑程序分析的标准技术轻松有效地实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Compositional analysis for concurrent constraint programming
A framework for the analysis of concurrent constraint programming (CCP) is proposed. The approach is based on simple denotational semantics that approximate the usual semantics in the sense that they give a superset of the input-output relation of a CCP program. Analyses based on these semantics can be easily and efficiently implemented using standard techniques from the analysis of logic programs.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信