Invited talk: Developing Efficient SMT Solvers
نویسنده
چکیده
Decision procedures for checking satisfiability of logical formulas are crucial for many verification applications. Of particular recent interest are solvers for Satisfiability Modulo Theories (SMT). SMT solvers decide logical satisfiability (or dually, validity) of formulas in classical multi-sorted first-order logic with equality, with respect to a background theory. The success of SMT for verification applications is largely due to the suitability of supported background theories for expressing verification conditions. In this talk I will discuss how modern SMT solvers work, and the main implementation techniques used. I will also describe how SMT solvers are used in industry and Microsoft in particular.
منابع مشابه
Proceedings of the 9 th International Workshop on Satisfiability Modulo Theories ( SMT ) 2011
s of Invited Talks Software Construction using Executable Constraints. Viktor Kuncak (EPFL) Constructing software that satisfies the desired properties can greatly benefit from solvers based on satisfiability modulo theories (SMT) paradigm. We propose a research program in which software construction and SMT technology become even more interconnected than today. Instead of checking properties o...
متن کاملThe Architecture of Inference from SMT to ETB
Modularity plays a central role in logical reasoning. We want to be able to reuse proofs, proof patterns, theories, and specialized reasoning procedures. Architectures that support modularity have been developed at all levels of inference: SAT solvers, theory solvers, combination solvers and rewriters, SMT solvers, simplifiers, rewriters, and tacticsbased interactive theorem provers. Prior work...
متن کاملModel Checking: New Challenges and Opportunities for Automated Reasoning (Invited Talk)
Software Model Checking is emerging as one of the leading approaches to automatic program analysis. State-of-the-art software model checkers exhibit levels of automation and precision often superior to those provided by traditional software analysis tools. This success is due to a large extent to the use of Satisfiability Modulo Theory (SMT) solvers to support reasoning about complex and even i...
متن کاملMulti-solver Support in Symbolic Execution
In this talk, we will present the results reported in our CAV 2013 paper [6] on integrating support for multiple SMT solvers in the dynamic symbolic execution engine KLEE [2]. In particular, we will outline the key characteristics of the SMT queries generated during symbolic execution, introduce an extension of KLEE that uses a number of state-of-the-art SMT solvers (Boolector [1], STP [4] and ...
متن کاملTrends and Challenges in Satisfiability Modulo Theories
Satisfiability Modulo Theories (SMT) is concerned with the problem of determining the satisfiability of first-order formulas with respect to a given logical theory T . A distinguishing feature of SMT is the use of inference methods tailored to the particular theory T . By being theory-specific and restricting their language to certain classes of formulas (such as, typically but not exclusively,...
متن کامل