{"title":"证明数据并行程序的正确性:证明大纲方法","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":"{\"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}","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}
Proving data-parallel programs correct: the proof outlines approach
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
