An interpolating theorem prover
We present a method of deriving Craig interpolants from proofs in the quantifier-free theory of linear inequality and uninterpreted function symbols, and an interpolating theorem prover based on this method. The prover has been used for predicate refinement in the B LAST software model checker, and...
Saved in:
Published in: | Theoretical computer science Vol. 345; no. 1; pp. 101 - 121 |
---|---|
Main Author: | |
Format: | Journal Article Conference Proceeding |
Language: | English |
Published: |
Amsterdam
Elsevier B.V
21-11-2005
Elsevier |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | We present a method of deriving Craig interpolants from proofs in the quantifier-free theory of linear inequality and uninterpreted function symbols, and an interpolating theorem prover based on this method. The prover has been used for predicate refinement in the B
LAST software model checker, and can also be used directly for model checking infinite-state systems, using interpolation-based image approximation. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 0304-3975 1879-2294 |
DOI: | 10.1016/j.tcs.2005.07.003 |