Effective Algorithms for the Satisfiability of Quantifier-Free Formulas Over Linear Real and Integer Arithmetic
<p> A core technique of modern tools for formally reasoning about computing systems is generating and dispatching queries to automated theorem provers, including Satisfiability Modulo Theories (SMT) provers. SMT provers aim at the tight integration of decision procedures for propositional sati...
| Main Author: | |
|---|---|
| Language: | EN |
| Published: |
New York University
2014
|
| Subjects: | |
| Online Access: | http://pqdtopen.proquest.com/#viewpdf?dispub=3665163 |