Satisfiability Modulo Theories: Introduction and Applications.
The article discusses Satisfiability Modulo Theories (SMT) solvers, which are said to be the core of many tools for program analysis, testing, and verification. The topics of constraint satisfaction, propositional satisfiability, and Boolean variables are addressed. SMT solvers are able to check the...
| Publicado en: | Communications of the ACM Vol. 54; no. 9; pp. 69 - 78 |
|---|---|
| Autores principales: | , |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Sep2011
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |