Researchclopedia

Research Researchers Institutions Topics Submit About

Command Palette

Search for a command to run...

Researchclopedia

Research Researchers Institutions About

© 2026 Researchclopedia. Powered by OpenAlex under CC0 license.

Back to research

Satisfiability modulo theories

2011619 citationsJournal Article

Authors

Leonardo de Moura · Microsoft (United States)

Nikolaj Bjørner · Microsoft (United States)

Abstract

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

Topics & Keywords

Logic, programming, and type systems Formal Methods in Verification Logic, Reasoning, and Knowledge

Publication Details

Published in: Communications of the ACM

Volume 54, Issue 9, pp. 69-77

DOI: 10.1145/1995376.1995394

Field-Weighted Citation Impact: 46.62

Satisfiability modulo theories | Researchclopedia