The Laws of Programming with Concurrency
7 869
16.4
Microsoft Research330 тыс
Следующее
22.06.16 – 4837:43Популярные
01.02.23 – 3 8394:51
12.12.22 – 78332:34Опубликовано 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).
Свежие видео
3 дня – 1 1780:30
4 дня – 7670:48
4 дня – 5 6222:15
8 дней – 1 9031:00
175 дней – 660 0454:20:29Случайные видео
284 дня – 8 0190:45
19.05.23 – 7281:02
12.11.21 – 9 79359:00
13.05.21 – 13 1951:05:44
22.06.12 – 5 37615:59
1 день – 36 48613:35
5 дней – 1492:20
9 дней – 73 6182:38
10 дней – 6880:41
