Relevance Heuristics for Program Analysis
90
Microsoft Research330 тыс
Следующее
06.09.16 – 2081:00:18Популярные
150 дней – 3 5898:50
161 день – 6113:07:51Опубликовано 6 сентября 2016, 18:39
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where needed, while maintaining scalability. In this talk I will discuss the principles by which SAT solvers and other decision procedures decide what information is relevant to a given proof. Then we will see how these ideas can be exploited in program verification using the method of Craig interpolation. The result is an analysis that is finely tuned to prove a given property of a program. At the end of the talk, I will cover some recent research in this area, including the use of interpolants for verifying heap-manipulating programs.
Свежие видео
17 дней – 71 19335:10
18 дней – 3021:28
19 дней – 1 35648:26
19 дней – 5 1670:34
25 дней – 5 25811:17Случайные видео
104 дня – 28 5358:05
298 дней – 249 44214:32
343 дня – 55 5210:51
16.06.23 – 1 9764:05
27.02.22 – 125 6379:01
09.05.20 – 124 0001:29
3 дня – 4 0812:29
5 дней – 5 2270:48
6 дней – 1 9550:56
11 дней – 2 2190:20
16 дней – 302 3214:56
21 день – 36 0741:29
27 дней – 789 3220:43
6 дней – 9020:12