ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement

Podelski, Andreas; Rybalchenko, Andrey

doi:10.1007/978-3-540-69611-7_16

アイテム詳細

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

一時保存へ追加

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

公開

会議論文

ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement

MPS-Authors

/persons/resource/persons45201

Podelski, Andreas
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45328

Rybalchenko, Andrey
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

引用

Podelski, A., & Rybalchenko, A. (2007). ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement. In M., Hanus (Ed.), Practical aspects of declarative languages : 9th International Symposium, PADL 2007 (pp. 245-259). Berlin, Germany: Springer.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-1E2E-A

要旨

Software model checking with abstraction refinement is emerging as a practical approach to verify industrial software systems. Its distinguishing characteristics lie in the way it applies logical reasoning to deal with abstraction. It is therefore natural to investigate whether and how the use of a constraint-based programming language may lead to an elegant and concise implementation of a practical tool. In this paper we describe the outcome of our investigation. Using a Prolog system together with Constraint Logic Programming extensions as the implementation platform of our choice we have built such a tool, called ARMC (for Abstraction Refinement Model Checking), which has already been used for practical verification.