1076 search results - page 176 / 216 » Operations on proofs and labels |
RTSS
1999
IEEE
14 years 1 months ago
1999
IEEE
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...
FSTTCS
1999
Springer
14 years 1 months ago
1999
Springer
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...
FOCS
1998
IEEE
14 years 1 months ago
1998
IEEE
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...
B
1998
Springer
14 years 1 months ago
1998
Springer
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,...
PODC
1997
ACM
14 years 1 months ago
1997
ACM
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...