<--- Back to Details
First PageDocument Content
Theoretical computer science / Logic in computer science / Electronic design automation / Formal methods / NP-complete problems / Constraint programming / Satisfiability modulo theories / Solver / Benchmark
Date: 2018-06-12 08:25:55
Theoretical computer science
Logic in computer science
Electronic design automation
Formal methods
NP-complete problems
Constraint programming
Satisfiability modulo theories
Solver
Benchmark

12th International Satisfiability Modulo Theories Competition SMT-COMPMatthias Heizmann (co-organizer)

Add to Reading List

Source URL: smtcomp.sourceforge.net

Download Document from Source Website

File Size: 833,66 KB

Share Document on Facebook

Similar Documents