The Laws of Programming with Concurrency
7 987
16
Microsoft Research334 тыс
Следующее
22.06.16 – 4837:43Популярные
Опубликовано 22 июня 2016, 2:25
Regular algebra provides a full set of simple laws for the programming of abstract state machines by regular expressions. They apply equally to sequential programs run on real computers. When extended by similar laws for interleaving of regular expressions, they apply also to programs for modern concurrent and distributed systems. Evidence for this claim is given by deriving from the algebra a concurrent extension of Hoare Logic (O’Hearn’s separation logic), and also an operational semantics for Milner’s process calculus (CCS).
Свежие видео
2 дня – 155 5440:27
2 дня – 25 18910:06
3 дня – 3 2351:05:03
6 дней – 7730:45
9 дней – 37133:31
9 дней – 1 539 60123:37Случайные видео
218 дней – 2 5244:00
327 дней – 25 4380:38
02.04.23 – 3 116 0860:59
31.08.22 – 25 4071:00:27
26.06.21 – 36 0629:40
05.04.11 – 297 4376:22
2 дня – 9581:30
3 дня – 31 1919:52
3 дня – 62253:30
4 дня – 20 05816:32
5 дней – 12 7401:25
5 дней – 5730:58
9 дней – 1 1378:34
21 час – 5 1640:56