Affiliation:
1. Nanjing University of Aeronautics and Astronautics, Nanjing, P. R. China
2. Information Engineering University, The Department’s Zhengzhou, P. R. China
3. State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou, P. R. China
Abstract
This paper combines rely/guarantee, abstract patterns and matching logic to reason about concurrent programs in a modular and compositional manner. According to the separation property, the state can be divided into two disjoint parts, the local state and the shared state. We use matching logic to deal with the local state, and use rely/guarantee and abstract patterns to deal with the shared state. The power of rely/guarantee is to describe interference between concurrent programs. The advantage of abstract patterns is supporting fictional separation, which indicates that we logically consider abstract patterns to represent disjoint elements, although these elements are not disjoint under a certain implementation. By combining the advantages of rely/guarantee, abstract patterns and matching logic, our approach realize that clients of the module can be verified completely according to the specification of the module, regardless of the implementation of the module. In addition, we use several examples to illustrate our approach, define our logic judgments, and prove the soundness of our logic.
Publisher
World Scientific Pub Co Pte Ltd
Subject
Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Software
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Interactive Matching Logic Proofs in Coq;Theoretical Aspects of Computing – ICTAC 2023;2023