Reachability logic has been applied to \(\mathbb {K}\) rewrite-rule-based language definitions as a language-generic logic of programs. To be able to verify not just code but also distributed system designs, a new rewrite-theory-generic reachability logic is presented and proved sound for a wide class of rewrite theories. Constructor-based semantic unification, matching, and satisfiability procedures greatly increase the range of decidable background theories that can be used in reachability logic proofs. New methods for proving invariants of possibly never terminating distributed systems are developed, and experiments with a prototype implementation illustrating the new proof methods are presented.

中文翻译：

---

重写理论的基于构造函数的可达性逻辑

可达性逻辑已应用于 \(\mathbb {K}\) 重写基于规则的语言定义，作为程序的语言通用逻辑。为了不仅能够验证代码，还能够验证分布式系统设计，提出了一种新的重写理论通用可达性逻辑，并证明了适用于各种重写理论的合理性。基于构造函数的语义统一、匹配和可满足性过程大大增加了可用于可达性逻辑证明的可判定背景理论的范围。开发了证明可能永远不会终止的分布式系统的不变量的新方法，并展示了演示新证明方法的原型实现实验。