An interpolating decision procedure for transitive relations with uninterpreted functions
We present a proof-generating decision procedure for the quantifier-free fragment of first-order logic with the relations =, !=, >=, and > and argue that this logic, augmented with a set of theory-specific rewriting rules, is adequate for bit-level accurate verification. We describe ou...
| المؤلفون الرئيسيون: | , |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | Book section |
| اللغة: | English |
| منشور في: |
2009
|
| الموضوعات: |