2137 search results - page 213 / 428 » Proving Abstract Non-interference |
120
Voted
WDAG
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We have a new proof of the lower bound that k-set agreement requires f/k + 1 rounds in a synchronous, message-passing model with f crash failures. The proof involves cons...
145
Voted
INFOCOM
2000
IEEE
15 years 7 months ago
2000
IEEE
Abstract— Alternate path routing has been well-explored in telecommunication networks as a means of decreasing the call blocking rate and increasing network utility. However, asi...
118
Voted
ASIACRYPT
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We introduce weaker models for non-interactive zero knowledge, in which the dealer is not restricted to deal a truly random string and may also have access to the input t...
134
click to vote
CADE
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
121
click to vote
CAV
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Bounded Model Checking based on SAT methods has recently been introduced as a complementary technique to BDD-based Symbolic Model Checking. The basic idea is to search fo...