{"title":"基于附加语义关系Petri网的数据竞争检测方法","authors":"A. Ivutin, A. Voloshko, Viktor N. Izotov","doi":"10.1109/ELEKTRO49696.2020.9130252","DOIUrl":null,"url":null,"abstract":"One of the most common and poorly detectable errors in parallel algorithms is data race condition. The article proposes an approach to detecting such states of data races based on simulation of a program using the mathematical apparatus of Petri nets with additional semantic relations. Based on chains of semantic relations between places belonging to different parallel threads, memory allocation places and other intermediate places, it is possible to detect data races associated with incorrect organization of access to a shared resource.","PeriodicalId":165069,"journal":{"name":"2020 ELEKTRO","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Approach to Data Race Detection Based on Petri Nets with Additional Semantic Relations\",\"authors\":\"A. Ivutin, A. Voloshko, Viktor N. Izotov\",\"doi\":\"10.1109/ELEKTRO49696.2020.9130252\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the most common and poorly detectable errors in parallel algorithms is data race condition. The article proposes an approach to detecting such states of data races based on simulation of a program using the mathematical apparatus of Petri nets with additional semantic relations. Based on chains of semantic relations between places belonging to different parallel threads, memory allocation places and other intermediate places, it is possible to detect data races associated with incorrect organization of access to a shared resource.\",\"PeriodicalId\":165069,\"journal\":{\"name\":\"2020 ELEKTRO\",\"volume\":\"57 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 ELEKTRO\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ELEKTRO49696.2020.9130252\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 ELEKTRO","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ELEKTRO49696.2020.9130252","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Approach to Data Race Detection Based on Petri Nets with Additional Semantic Relations
One of the most common and poorly detectable errors in parallel algorithms is data race condition. The article proposes an approach to detecting such states of data races based on simulation of a program using the mathematical apparatus of Petri nets with additional semantic relations. Based on chains of semantic relations between places belonging to different parallel threads, memory allocation places and other intermediate places, it is possible to detect data races associated with incorrect organization of access to a shared resource.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
