{"title":"基于语义的并发程序分析方法","authors":"R. Carver, K. Tai","doi":"10.1109/WST.1988.5365","DOIUrl":null,"url":null,"abstract":"Concurrent programs are analyzed by deriving constraints on the feasible SYN-sequences of a concurrent program according to the programs's syntactic and semantic information. These constraints, called feasibility constraints, show restrictions on the ordering of synchronization events allowed by the program. By using feasibility constraints, one can obtain a better approximation of the feasibility set of a concurrent program and improve the effectiveness of error detection by static analysis.<<ETX>>","PeriodicalId":269073,"journal":{"name":"[1988] Proceedings. Second Workshop on Software Testing, Verification, and Analysis","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A semantics-based approach to analyzing concurrent programs\",\"authors\":\"R. Carver, K. Tai\",\"doi\":\"10.1109/WST.1988.5365\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Concurrent programs are analyzed by deriving constraints on the feasible SYN-sequences of a concurrent program according to the programs's syntactic and semantic information. These constraints, called feasibility constraints, show restrictions on the ordering of synchronization events allowed by the program. By using feasibility constraints, one can obtain a better approximation of the feasibility set of a concurrent program and improve the effectiveness of error detection by static analysis.<<ETX>>\",\"PeriodicalId\":269073,\"journal\":{\"name\":\"[1988] Proceedings. Second Workshop on Software Testing, Verification, and Analysis\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-07-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] Proceedings. Second Workshop on Software Testing, Verification, and Analysis\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WST.1988.5365\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. Second Workshop on Software Testing, Verification, and Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WST.1988.5365","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A semantics-based approach to analyzing concurrent programs
Concurrent programs are analyzed by deriving constraints on the feasible SYN-sequences of a concurrent program according to the programs's syntactic and semantic information. These constraints, called feasibility constraints, show restrictions on the ordering of synchronization events allowed by the program. By using feasibility constraints, one can obtain a better approximation of the feasibility set of a concurrent program and improve the effectiveness of error detection by static analysis.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[1988] Proceedings. Second Workshop on Software Testing, Verification, and Analysis](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
