From formal verification to high-performance constraint solving
1 367
28.5
Microsoft Research330 тыс
Следующее
21.06.16 – 3458:56Популярные
Опубликовано 21 июня 2016, 23:36
SAT and SAT Modulo Theories (SMT) are workhorses of formal verification. But they are also highly effective for constraint solving and optimization. In this talk we explain how this idea has been validated at Barcelogic.com and elsewhere. We shorty introduce SAT/SMT as well as our new IntSat method for Integer Linear Programming (ILP) and 0-1 ILP. Then we analyze some of our customers' problems, explaining why we used our own tools or other classical ones. A short demo will illustrate easy logic-based modeling and cases where our solvers outperform the best-known commercial ones.
Свежие видео
5 дней – 4 9501:14
10 дней – 1825:06
10 дней – 20 7260:16
11 дней – 1460:37
12 дней – 65339:41
12 дней – 4078:40Случайные видео
116 дней – 1 0733:17
252 дня – 76 5979:41
20.08.23 – 17 7570:26
10.07.23 – 12222:37
28.01.22 – 69 5190:27
06.08.20 – 74 8767:56
3 дня – 1 1780:30
5 дней – 3 8611:56
8 дней – 174 0721:05
10 дней – 4 4700:48
11 дней – 3 7730:29
1 день – 2 72338:59