Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete

Maier, Patrick; Gordon, Andrew D.

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete

MPS-Authors

/persons/resource/persons44970

Maier, Patrick
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Maier, P. (2003). Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete. In Foundations of software science and computation structures: 6th International Conference, FOSSACS 2003 (pp. 343-357). Berlin, Germany: Springer.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-2C93-6

要旨

Circular assume-guarantee reasoning is used for the compositional verification of concurrent systems. Its soundness has been studied in depth, perhaps because circularity makes it anything but obvious. In this paper, we investigate completeness. We show that compositional circular assume-guarantee rules cannot be both sound and complete.