Satisfiability modulo theories: introduction and applications

  • Authors:
  • Leonardo De Moura;Nikolaj Bjørner

  • Affiliations:
  • Microsoft Research, Redmond, WA;Microsoft Research, Redmond, WA

  • Venue:
  • Communications of the ACM
  • Year:
  • 2011

Quantified Score

Hi-index 48.26

Visualization

Abstract

Checking the satisfiability of logical formulas, SMT solvers scale orders of magnitude beyond custom ad hoc solvers.