Back to Results
First PageMeta Content
Mathematical logic / Theoretical computer science / Mathematics / Quantification / Logic in computer science / Formal methods / Electronic design automation / NP-complete problems / Satisfiability modulo theories / Boolean satisfiability problem / Universal quantification / True quantified Boolean formula


Challenges for Fast Synthesis Procedures in SMT Andrew Reynolds1 Department of Computer Science, The University of Iowa Abstract A number of synthesis applications are made possible by automated tools for synthesis. Rece
Add to Reading List

Document Date: 2017-07-30 15:10:48


Open Document

File Size: 154,04 KB

Share Result on Facebook
UPDATE