The System FL_<m,n> for Specification Analysis and its Completeness Theorem

スポンサーリンク

概要

• 論文の詳細を見る

• A formal System FL_<m,n> is proposed to analyze the specification of concurrent programs. The completeness theorem (soundness and completeness) for FL_<m,n> is also proved.

• 一般社団法人情報処理学会の論文
• 1987-03-15

著者

• Yamada S

  Hiroshima Univ. Hiroshima‐shi Jpn

• HIROSE KEN

  Waseda University

• TAKAHASHI MAKOTO

  Waseda University

• YAMADA SHINICHI

  Waseda University

関連論文

• The System FL_<m,n> for Specification Analysis and its Completeness Theorem
• A Graph Model for Probabilistic Computation

スポンサーリンク