Abstract Starting with the analysis of the source codes of the Python Software Transactional Memory (PSTM) architecture, this paper applies process algebra CSP to formally verify the architecture at a fine-grained level. We analyze the communication process and components of the architecture from multiple perspectives and establish models describing the communication behaviors of the PSTM architecture. We use model checker PAT to automatically simulate and verify the established model. After adapting the traditional transactional properties to the PSTM architecture, we analyze and verify five properties for the PSTM architecture, including deadlock freeness, atomicity, isolation, consistency and optimism. The verification results indicate that all the properties are valid. Based on the judgement of the execution logic of the communication procedure in the PSTM architecture, we can conclude that the architecture can have a proper communication and can guarantee atomicity, isolation, consistency and optimism. Besides, we also provide a case study with an application scenario and propose a corollary that the value of the shared counter is equal to the number of parallel processes. We verify whether the case study system can satisfy all the conditions of corollary from both positive and negative perspectives. The results show that the corollary is tenable.

中文翻译：

---

使用 CSP 对 PSTM 架构进行形式化分析和验证

摘要 本文从分析Python软件事务性内存（PSTM）架构的源代码入手，应用过程代数CSP在细粒度级别对架构进行形式化验证。我们从多个角度分析了架构的通信过程和组件，并建立了描述 PSTM 架构通信行为的模型。我们使用模型检查器 PAT 来自动模拟和验证建立的模型。在将传统的事务属性适应 PSTM 架构后，我们分析并验证了 PSTM 架构的五个属性，包括死锁自由度、原子性、隔离性、一致性和乐观性。验证结果表明所有属性都有效。基于对PSTM架构中通信过程的执行逻辑的判断，我们可以得出这样的结论：该架构可以进行适当的通信，并且可以保证原子性、隔离性、一致性和乐观性。此外，我们还提供了一个应用场景的案例研究，并提出了共享计数器的值等于并行进程数的推论。我们从正面和负面的角度验证案例研究系统是否能够满足推论的所有条件。结果表明推论是成立的。我们还提供了一个具有应用场景的案例研究，并提出了共享计数器的值等于并行进程数的推论。我们从正面和负面的角度验证案例研究系统是否能够满足推论的所有条件。结果表明推论是成立的。我们还提供了一个具有应用场景的案例研究，并提出了共享计数器的值等于并行进程数的推论。我们从正面和负面的角度验证案例研究系统是否能够满足推论的所有条件。结果表明推论是成立的。