<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2012-05-29 03:59:19Constraint programming Logic in computer science Automated theorem proving Electronic design automation NP-complete problems Satisfiability Modulo Theories Boolean satisfiability problem Uninterpreted function Decision problem Theoretical computer science Mathematics Applied mathematics |
| Leveraging SMT: Using SMT Solvers to Improve Verification; Using Verification to Improve SMT Solvers Clark Barrett Christopher L. ConwayDocID: 1q4Fy - View Document |
| Published in Proc. of “Conference on Automated Deduction (CADE)”, A Randomized Satisfiability Procedure for Arithmetic and Uninterpreted Function Symbols Sumit Gulwani and George C. Necula University of CalifoDocID: 1eRWU - View Document |
| A Randomized Satisfiability Procedure for Arithmetic and Uninterpreted Function Symbols 1 Sumit Gulwani , George C. Necula Department of Computer Science, UC-Berkeley, Berkeley, CA 94720, USADocID: 1dnqO - View Document |
| Weakly Equivalent Arrays J¨ urgen Christ and Jochen Hoenicke∗ arXiv:1405.6939v1 [cs.LO] 27 May 2014DocID: 18K31 - View Document |
| PDF DocumentDocID: 17uB6 - View Document |