Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

CSL

2004

Springer

2004

Springer

Abstract. Applications in software veriﬁcation often require determining the satisﬁability of ﬁrst-order formulæ with respect to some background theories. During development, conjectures are usually false. Therefore, it is desirable to have a theorem prover that terminates on satisﬁable instances. Satisﬁability Modulo Theories (SMT) solvers have proven highly scalable, eﬃcient and suitable for integrated theory reasoning. Superposition-based inference systems are strong at reasoning with equalities, universally quantiﬁed variables, and Horn clauses. We describe a calculus that tightly integrates Superposition and SMT solvers. The combination is refutationally complete if background theory symbols only occur in ground formulæ, and non-ground clauses are variable inactive. Termination is enforced by introducing additional axioms as hypotheses. The calculus detects any unsoundness introduced by these axioms and recovers from it.

Related Content

Added |
01 Jul 2010 |

Updated |
01 Jul 2010 |

Type |
Conference |

Year |
2004 |

Where |
CSL |

Authors |
Christopher Lynch |

Comments (0)