Proving data-parallel programs correct: the proof outlines approach

L. Bougé, D. Cachera
{"title":"Proving data-parallel programs correct: the proof outlines approach","authors":"L. Bougé, D. Cachera","doi":"10.1109/PMMPC.1995.504360","DOIUrl":null,"url":null,"abstract":"We present a proof outline generation system for a simple data-parallel kernel language called /spl Lscr/. Proof outlines for /spl Lscr/ are very similar to those for usual scalar-like languages. In particular, they can be mechanically generated backwards from the final post-assertion of the program. They appear thus as a valuable basis to implement a validation assistance tool for data-parallel programming. The equivalence between proof outlines and the sound and complete Hoare logic defined for /spl Lscr/ in previous papers is also discussed.","PeriodicalId":344246,"journal":{"name":"Programming Models for Massively Parallel Computers","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Programming Models for Massively Parallel Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PMMPC.1995.504360","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We present a proof outline generation system for a simple data-parallel kernel language called /spl Lscr/. Proof outlines for /spl Lscr/ are very similar to those for usual scalar-like languages. In particular, they can be mechanically generated backwards from the final post-assertion of the program. They appear thus as a valuable basis to implement a validation assistance tool for data-parallel programming. The equivalence between proof outlines and the sound and complete Hoare logic defined for /spl Lscr/ in previous papers is also discussed.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
证明数据并行程序的正确性:证明大纲方法
我们提出了一个简单的数据并行内核语言/spl Lscr/的证明大纲生成系统。/spl Lscr/的证明大纲与通常的类标量语言的证明大纲非常相似。特别是,它们可以从程序的最后断言后机械地向后生成。因此,它们是实现数据并行编程的验证辅助工具的有价值的基础。文中还讨论了证明轮廓与前人关于/spl Lscr/定义的完备完备霍尔逻辑的等价性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A package for automatic parallelization of serial C-programs for distributed systems The parallel Fortran family and a new perspective Proving data-parallel programs correct: the proof outlines approach Facilitating the development of portable parallel applications on distributed memory systems The refinement of high-level parallel algorithm specifications
×
引用
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