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...
Egile Nagusiak: | Kroening, D, Weissenbacher, G |
---|---|
Beste egile batzuk: | Namjoshi, K |
Formatua: | Book section |
Hizkuntza: | English |
Argitaratua: |
2009
|
Gaiak: |
Antzeko izenburuak
-
An Interpolating Decision Procedure for Transitive Relations with Uninterpreted Functions
nork: Kroening, D, et al.
Argitaratua: (2010) -
Program analysis with interpolants
nork: Weissenbacher, G, et al.
Argitaratua: (2010) -
Repairing strings and trees
nork: Riveros Jaeger, C
Argitaratua: (2013) -
Abstract satisfaction
nork: Haller, L
Argitaratua: (2013) -
EL-ifying ontologies
nork: Carral, D, et al.
Argitaratua: (2014)