Sometime = always + recursion ≡ always on the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs Patrick CousotRadhia Cousot OriginalPaper Pages: 1 - 31
A formal semantics for concurrent systems with a priority relation Ryszard Janicki OriginalPaper Pages: 33 - 55
Partial parametrization eliminates multiple traversals of data structures Masato Takeichi OriginalPaper Pages: 57 - 77
Electing a leader in a ring with link failures Oded GoldreichLiuba Shrira OriginalPaper Pages: 79 - 91
Analysis of space allocation in a generally fragmented linear store C. H. C. Leung OriginalPaper Pages: 93 - 104