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...
Main Authors: | Kroening, D, Weissenbacher, G |
---|---|
Outros autores: | Namjoshi, K |
Formato: | Book section |
Idioma: | English |
Publicado: |
2009
|
Subjects: |
Títulos similares
-
An Interpolating Decision Procedure for Transitive Relations with Uninterpreted Functions
por: Kroening, D, et al.
Publicado: (2010) -
Program analysis with interpolants
por: Weissenbacher, G, et al.
Publicado: (2010) -
Repairing strings and trees
por: Riveros Jaeger, C
Publicado: (2013) -
Abstract satisfaction
por: Haller, L
Publicado: (2013) -
EL-ifying ontologies
por: Carral, D, et al.
Publicado: (2014)