The e ective design of composite dependable and real-time protocols entails demonstrating their proof of correctness and, in practice, the e cient delivery of services. We focus o...
We present a (the rst?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with call-by-value parameters...
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
In B, the expression of dynamic constraints is notoriously missing. In this paper, we make various proposals for introducing them. They all express, in di erent complementary ways,...
Conditions on a shared object type T are given that are both necessary and sufficient for wait-free n-process consensus to be solvable using objects of type T and registers. The co...