On Hierarchical Reasoning in Combinations of Theories

Ihlemann, Carsten; Sofronie-Stokkermans, Viorica

doi:10.1007/978-3-642-14203-1_4

アイテム詳細

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

一時保存へ追加

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

公開

会議論文

On Hierarchical Reasoning in Combinations of Theories

MPS-Authors

/persons/resource/persons44669

Ihlemann, Carsten
Automation of Logic, MPI for Informatics, Max Planck Society;

/persons/resource/persons45516

Sofronie-Stokkermans, Viorica
Automation of Logic, 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

引用

Ihlemann, C., & Sofronie-Stokkermans, V. (2010). On Hierarchical Reasoning in Combinations of Theories. In J., Giesl, & R., Hähnle (Eds.), Automated Reasoning (pp. 30-45). Berlin: Springer. doi:10.1007/978-3-642-14203-1_4.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-14B9-D

要旨

In this paper we study theory combinations over non-disjoint signatures in which hierarchical and modular reasoning is possible. We use a notion of locality of a theory extension parameterized by a closure operator on ground terms. We give criteria for recognizing these types of theory extensions. We then show that combinations of extensions of theories which are local in this extended sense also have a locality property and hence allow modular and hierarchical reasoning. We thus obtain parameterized decidability and complexity results for many (combinations of) theories important in verification.