Machine-Checked Correctness and Complexity of a Union-Find Implementation
26
Microsoft Research329 тыс
Следующее
22.06.16 – 9563:25Популярные
275 дней – 11 20712:33
329 дней – 3101:00:50Опубликовано 22 июня 2016, 19:12
Union-Find is a famous example of a simple data structure whose amortized asymptotic time complexity analysis is non-trivial. Using Coq and the CFML tool, Arthur Charguéraud and I have verified the correctness and amortized complexity of an OCaml implementation of Union-Find. In this talk, I will give an overview of our approach, which uses higher-order separation logic extended with time credits. This approach allows us to state (and establish) a single specification that covers correctness and complexity at the same time.
Свежие видео
5 дней – 28 68813:26
7 дней – 7 0769:59
8 дней – 8 0410:26
9 дней – 126 3280:16
13 дней – 3768:31
13 дней – 4 2160:35Случайные видео
350 дней – 827 14619:15
31.03.23 – 24 26345:10
02.11.22 – 1 1392:50
07.09.22 – 584 6112:14
23.07.22 – 97 4487:14
07.07.22 – 352 5200:42
2 дня – 952:43
3 дня – 46 36116:25
8 дней – 5261:29
8 дней – 5980:48
13 дней – 968 9370:53
13 дней – 149 7858:31
14 дней – 3534:49
2 дня – 2360:40