Back to Results
First PageMeta Content



Fast and Flexible Proof Checking for SMT Duckki Oe, Andrew Reynolds, and Aaron Stump Computer Science, The University of Iowa, USA Abstract. Fast and flexible proof checking can be implemented for SMT using the Edinburgh
Add to Reading List

Document Date: 2012-05-01 17:51:48


Open Document

File Size: 233,12 KB

Share Result on Facebook
UPDATE