Uninterpreted function - PDFSEARCH.IO - Document Search Engine

Uninterpreted function
Results: 7

#	Item
1	Leveraging SMT: Using SMT Solvers to Improve Verification; Using Verification to Improve SMT Solvers Clark Barrett Christopher L. Conway Add to Reading List Source URL: fm.csl.sri.com Language: English - Date: 2010-10-30 16:21:50 Theoretical computer science Formal methods Logic in computer science Constraint programming Electronic design automation NP-complete problems Satisfiability modulo theories Solver SMT Uninterpreted function Model checking Alt-Ergo
2	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 Califo Add to Reading List Source URL: www.cs.berkeley.edu - Date: 2010-10-29 12:59:29
3	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, USA Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2010-10-29 12:59:41
4	Weakly Equivalent Arrays J¨ urgen Christ and Jochen Hoenicke∗ arXiv:1405.6939v1 [cs.LO] 27 May 2014 Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-05-27 20:45:29 Arrays Array data type Array data structure Equivalence relation C Uninterpreted function Weak equivalence Bit array Satisfiability Modulo Theories Computing Software engineering Computer programming
5	PDF Document Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2012-05-29 03:59:19 Constraint 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
6	CS109B Notes for LecturePredicates Essentially Boolean-valued functions with arguments of arbitrary type. But predicates are uninterpreted; a predicate named , for example, need not givethe value TRUE. Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:59:19 Predicate logic First-order logic Free variables and bound variables Function Universal quantification Predicate FO Propositional variable Independence Logic Mathematical logic Mathematics
7	Handbook of Satisfiability Armin Biere, Marijn Heule, Hans van Maaren and Toby Walsch IOS Press, 2008 Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2009-01-24 01:34:38 Model theory Satisfiability Modulo Theories Interpretation Boolean satisfiability problem Well-formed formula Structure Uninterpreted function Theory Signature Logic Mathematical logic Mathematics