{"title":"xUML4MC中并发系统的有界模型检验方法","authors":"Xinfeng Shu, Zewei Yang","doi":"10.1145/3573942.3574016","DOIUrl":null,"url":null,"abstract":"In response to the problem that software testing cannot satisfy the verification of multi-threaded programs, a visual modeling language (Extending UML for Model Checking, xUML4MC) oriented concurrent program verification method is proposed. The concurrent program to be verified is visually modeled by xUML4MC; firstly, the visual concurrent system model is analyzed using program analysis techniques, and the concurrent system model is sequenced, and then the sequenced system model is transformed into a Lightweight Concurrent Transition System(LCTS);Then, we construct an impoverished system automaton corresponding to the LCTS, simplify its state space using a partial-order statute algorithm, extract the nature non-automaton to be verified, and verify the simplified impoverished system automaton and the nature non-automaton using a model checking technique. Experiments show that the developed model checking tool can successfully detect errors in concurrent programs and give counterexample paths.","PeriodicalId":103293,"journal":{"name":"Proceedings of the 2022 5th International Conference on Artificial Intelligence and Pattern Recognition","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Bounded Model Checking Method for Concurrent Systems in xUML4MC\",\"authors\":\"Xinfeng Shu, Zewei Yang\",\"doi\":\"10.1145/3573942.3574016\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In response to the problem that software testing cannot satisfy the verification of multi-threaded programs, a visual modeling language (Extending UML for Model Checking, xUML4MC) oriented concurrent program verification method is proposed. The concurrent program to be verified is visually modeled by xUML4MC; firstly, the visual concurrent system model is analyzed using program analysis techniques, and the concurrent system model is sequenced, and then the sequenced system model is transformed into a Lightweight Concurrent Transition System(LCTS);Then, we construct an impoverished system automaton corresponding to the LCTS, simplify its state space using a partial-order statute algorithm, extract the nature non-automaton to be verified, and verify the simplified impoverished system automaton and the nature non-automaton using a model checking technique. Experiments show that the developed model checking tool can successfully detect errors in concurrent programs and give counterexample paths.\",\"PeriodicalId\":103293,\"journal\":{\"name\":\"Proceedings of the 2022 5th International Conference on Artificial Intelligence and Pattern Recognition\",\"volume\":\"88 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2022 5th International Conference on Artificial Intelligence and Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3573942.3574016\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2022 5th International Conference on Artificial Intelligence and Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3573942.3574016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
针对软件测试不能满足多线程程序验证的问题,提出了一种面向可视化建模语言(extended UML for Model Checking, xUML4MC)的并发程序验证方法。用xUML4MC对待验证并发程序进行可视化建模;首先利用程序分析技术对可视化并发系统模型进行分析,并对并发系统模型进行排序,然后将排序后的系统模型转化为轻量级并发转换系统(LCTS);然后构造与LCTS对应的穷化系统自动机,利用分序规约算法简化其状态空间,提取待验证的本质非自动机;并利用模型检验技术对简化贫困系统的自动机和自然非自动机进行了验证。实验表明,所开发的模型检测工具能够成功地检测并发程序中的错误,并给出反例路径。
A Bounded Model Checking Method for Concurrent Systems in xUML4MC
In response to the problem that software testing cannot satisfy the verification of multi-threaded programs, a visual modeling language (Extending UML for Model Checking, xUML4MC) oriented concurrent program verification method is proposed. The concurrent program to be verified is visually modeled by xUML4MC; firstly, the visual concurrent system model is analyzed using program analysis techniques, and the concurrent system model is sequenced, and then the sequenced system model is transformed into a Lightweight Concurrent Transition System(LCTS);Then, we construct an impoverished system automaton corresponding to the LCTS, simplify its state space using a partial-order statute algorithm, extract the nature non-automaton to be verified, and verify the simplified impoverished system automaton and the nature non-automaton using a model checking technique. Experiments show that the developed model checking tool can successfully detect errors in concurrent programs and give counterexample paths.