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
|
| বিষয়গুলি: |
Search Result 1
An Interpolating Decision Procedure for Transitive Relations with Uninterpreted Functions
প্রকাশিত 2010
Conference item