Credit: HubPages
Checking the satisfiability of logical formulas, SMT solvers scale orders of magnitude beyond custom ad hoc solvers.
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.
Become a member to view this article and take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.
Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.