articleCommunications of the ACMAug 30, 2011Closed access

Satisfiability modulo theories

LDLeonardo de MouraNBNikolaj Bjørner

Microsoft (United States)

Indexed incrossref

Abstract

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

Citation impact

629
total citations
FWCI
46.15
Percentile
100%
References
33
Citations per year

Authors

2

Topics & keywords

Topics
Keywords
  • Modulo
  • Computer science
  • Satisfiability
  • Satisfiability modulo theories
  • Arithmetic
  • Algorithm
  • Theoretical computer science
  • Discrete mathematics
No related works found for this paper.