Transition Invariants
678
113
Microsoft Research330 тыс
Следующее
06.09.16 – 5057:25Популярные
249 дней – 16 84640:37
15.09.23 – 4 7423:33Опубликовано 6 сентября 2016, 5:09
Proof rules for the temporal verification of concurrent programs rely on auxiliary assertions. We propose a (sound and relatively complete) proof rule whose auxiliary assertions are transition invariants. A transition invariant of a program is a binary relation over program states that contains the transitive closure of the transition relation of the program. A transition invariant is disjunctively well-founded if it is a finite union of well-founded relations. We characterize the validity of a liveness property by the existence of a disjunctively well-founded transition invariant.
Свежие видео
12 дней – 3 2312:12
18 дней – 3 8320:24
18 дней – 97 13910:29Случайные видео
36 дней – 5 7740:16
68 дней – 181 6350:53
160 дней – 68018:33
15.07.23 – 4 4071:17:16
06.11.20 – 334 84712:51
16.03.12 – 5 11419:20
2 дня – 8980:21
2 дня – 9040:54
5 дней – 9320:31
6 дней – 86 98421:14
6 дней – 1 3483:41
9 дней – 1 2321:13
