Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
An Abstract Interpretation of DPLL(T)
verfasst von : Martin Brain, Vijay D’Silva, Leopold Haller, Alberto Griggio, Daniel Kroening
Erschienen in: Verification, Model Checking, and Abstract Interpretation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
dpll(t)
is a central algorithm for Satisfiability Modulo Theories (
smt
) solvers. The algorithm combines results of reasoning about the Boolean structure of a formula with reasoning about conjunctions of theory facts to decide satisfiability. This architecture enables modern solvers to combine the performance benefits of propositional satisfiability solvers and conjunctive theory solvers. We characterise
dpll(t)
as an abstract interpretation algorithm that computes a product of two abstractions. Our characterisation allows a new understanding of
dpll(t)
as an instance of an abstract procedure to combine reasoning engines beyond propositional solvers and conjunctive theory solvers. In addition, we show theoretically that the split into Boolean and theory reasoning is sometimes unnecessary and demonstrate empirically that it can be detrimental to performance.