First Page | Document Content | |
---|---|---|
Date: 2017-08-06 07:51:38Theoretical computer science Logic Logic in computer science Mathematics Electronic design automation Formal methods NP-complete problems Boolean algebra Boolean satisfiability problem Uninterpreted function Satisfiability Solver | SC2 challenges: when Satisfiability Checking and Symbolic Computation join forces James H. Davenport, Pascal Fontaine, Alberto Griggio (and the others partners whose details wouldn’t fit)1 University of Bath, LORIA, FoAdd to Reading ListSource URL: staff.bath.ac.ukDownload Document from Source WebsiteFile Size: 148,96 KBShare Document on Facebook |
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 |