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...
Prif Awduron: | Kroening, D, Weissenbacher, G |
---|---|
Awduron Eraill: | Namjoshi, K |
Fformat: | Book section |
Iaith: | English |
Cyhoeddwyd: |
2009
|
Pynciau: |
Eitemau Tebyg
-
An Interpolating Decision Procedure for Transitive Relations with Uninterpreted Functions
gan: Kroening, D, et al.
Cyhoeddwyd: (2010) -
Program analysis with interpolants
gan: Weissenbacher, G, et al.
Cyhoeddwyd: (2010) -
Repairing strings and trees
gan: Riveros Jaeger, C
Cyhoeddwyd: (2013) -
Abstract satisfaction
gan: Haller, L
Cyhoeddwyd: (2013) -
EL-ifying ontologies
gan: Carral, D, et al.
Cyhoeddwyd: (2014)