Back to Results
First PageMeta Content
Theoretical computer science / Formal methods / Logic / Mathematical logic / Logic in computer science / Model theory / Electronic design automation / NP-complete problems / Satisfiability modulo theories / Automated theorem proving / First-order logic / Satisfiability


Solving Quantified Verification Conditions using Satisfiability Modulo Theories Yeting Ge, Clark Barrett, Cesare Tinelli Solving Quantified Verification Conditions using Satisfiability Modulo Theories – p.1/28
Add to Reading List

Document Date: 2007-10-10 03:48:36

Open Document

File Size: 1,95 MB

Share Result on Facebook