Formal Verification in a First-Order Extension of Modal μ-calculus

スポンサーリンク

概要

• 論文の詳細を見る

• Formal verification is frequently based on modal μ-calculus and its fragments. However, the number of systems and verification properties which cannot be formalized in modal μ-calculus has been increasing as they become complicated. In this paper, we present a first-order extension of modal μ-calculus in order to formalize various such systems and verification properties. We also give an axiomatization of the logic. It is necessarily incomplete for the logic because the set of all valid formulas is not recursively enumerable. Finally, in order to demonstrate that our axiomatization is practical for verification, we formalize a system and mutual exclusion for unboundedly many processes in our first-order extension, and then verify that the system satisfies the property in our axiomatization.

• Information and Media Technologies 編集運営会議の論文

著者

• Okamoto Keishi

  Research Center for Verification and Semantics, National Institute of Advanced Industrial Science and Technology (AIST)

関連論文

• Formal Verification in a First-Order Extension of Modal μ-calculus

スポンサーリンク