{"title":"并行程序的不确定性和正确性","authors":"L. Flon, N. Suzuki","doi":"10.21236/ada043450","DOIUrl":null,"url":null,"abstract":"Abstract : This paper presents the weakest preconditions which describe weak correctness, blocking, deadlock, and starvation for nondeterministic programs. A procedure for converting parallel programs to nondeterministic programs is described, and the correctness of various example parallel programs is treated in this manner. Among these are a busy-wait mutual exclusion scheme, and the problem of the Five Dining Philosophers.","PeriodicalId":432086,"journal":{"name":"Formal Description of Programming Concepts","volume":"49 10","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1977-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Nondeterminism and the Correctness of Parallel Programs\",\"authors\":\"L. Flon, N. Suzuki\",\"doi\":\"10.21236/ada043450\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract : This paper presents the weakest preconditions which describe weak correctness, blocking, deadlock, and starvation for nondeterministic programs. A procedure for converting parallel programs to nondeterministic programs is described, and the correctness of various example parallel programs is treated in this manner. Among these are a busy-wait mutual exclusion scheme, and the problem of the Five Dining Philosophers.\",\"PeriodicalId\":432086,\"journal\":{\"name\":\"Formal Description of Programming Concepts\",\"volume\":\"49 10\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1977-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Formal Description of Programming Concepts\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.21236/ada043450\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Formal Description of Programming Concepts","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21236/ada043450","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Nondeterminism and the Correctness of Parallel Programs
Abstract : This paper presents the weakest preconditions which describe weak correctness, blocking, deadlock, and starvation for nondeterministic programs. A procedure for converting parallel programs to nondeterministic programs is described, and the correctness of various example parallel programs is treated in this manner. Among these are a busy-wait mutual exclusion scheme, and the problem of the Five Dining Philosophers.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
