Communications of the ACM

Home/Magazine Archive/September 2011 (Vol. 54, No. 9)/Satisfiability Modulo Theories: Introduction and Applications/Abstract

Contributed articles

Satisfiability Modulo Theories: Introduction and Applications

By Leonardo De Moura, Nikolaj Bjørner
Communications of the ACM, September 2011, Vol. 54 No. 9, Pages 69-77
10.1145/1995376.1995394
Comments

View as: Print Mobile App ACM Digital Library In the Digital Edition Share: Send by email Share on reddit Share on StumbleUpon Share on Hacker News Share on Tweeter Share on Facebook

The Thinker examines irregular polygon drawing — Credit: HubPages

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

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.