Message-passing programs involve several processes with channel-based communications to deal with tasks concurrently. The complex computations and communications between processes make the verification of message-passing programs hard. By regarding the functions in programs as uninterpreted functions, we focus on the verification problem of message-passing uninterpreted programs. Although the usage of uninterpreted functions alleviates the computational difficulties brought by functions, the verification problem is still undecidable in general. In this work, we provide a decidable subclass of message-passing uninterpreted programs, wherein programs in this subclass satisfy the property of . The decidability result closely relies on communicating finite-state machine (CFM) with bounded channels. Based on the decidability result, we proposed a verification framework for message-passing uninterpreted programs.

中文翻译：

---

消息传递未解释程序的验证

消息传递程序涉及多个具有基于通道的通信的进程来同时处理任务。进程之间复杂的计算和通信使得消息传递程序的验证变得困难。通过将程序中的函数视为非解释函数，我们重点研究消息传递非解释程序的验证问题。尽管使用未解释函数减轻了函数带来的计算困难，但验证问题总体上仍然是不可判定的。在这项工作中，我们提供了消息传递未解释程序的可判定子类，其中该子类中的程序满足 的属性。可判定性结果密切依赖于有限状态机 (CFM) 与有界通道的通信。基于可判定性结果，我们提出了消息传递非解释程序的验证框架。