Abstract Satisfaction

Conference item

This article introduces an abstract interpretation framework that codifies the operations in SAT and SMT solvers in terms of lattices, transformers and fixed points. We develop the idea that a formula denotes a set of models in a universe of structures. This set of models has characterizations as fixed points of deduction, abduction and quantification transformers. A wide range of satisfiability procedures can be understood as computing and refining approximations of such fixed points. These include procedures in the DPLL family, those for preprocessing and inprocessing in SAT solvers, decision procedures for equality logics, weak arithmetics, and procedures for approximate quantification. Our framework provides a unified, mathematical basis for studying and combining program analysis and satisfiability procedures. A practical benefit of our work is a new, logic-agnostic architecture for implementing solvers.

Authors: D'Silva, V; Haller, L; Kroening, D

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: ACM
• Host title: Proceedings of the 41st annual ACM SIGPLAN−SIGACT symposium on Principles of programming languages
• Volume: 49
• Issue: 1
• Pages: 139-150
• Publication date: 2014-01-13
• DOI: 10.1145/2535838.2535868
• ISSN: 0362-1340
• ISBN: 9781450325448
• Keywords: Decision Procedures; Logic; Abstract interpretation; SBTMR