430 search results - page 25 / 86 » Efficient Proving for Practical Distributed Access-Control S... |
CCS
2009
ACM
16 years 11 days ago
2009
ACM
Distributed proof construction protocols have been shown to be valuable for reasoning about authorization decisions in open distributed environments such as pervasive computing sp...
103
click to vote
ASWC
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Ontology reasoning is an indispensable step to fully exploit the implicit semantics of Semantic Web data. The inherent distribution characteristic of the Semantic Web and...
132
click to vote
AOSD
2009
ACM
15 years 3 months ago
2009
ACM
Some security concerns are sensitive to flow of information in a program execution. The dataflow pointcut has been proposed by Masuhara and Kawauchi in order to easily implement s...
STOC
2001
ACM
16 years 1 days ago
2001
ACM
This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of inpu...
TPDS
1998
14 years 11 months ago
1998
—Coordinated checkpointing simplifies failure recovery and eliminates domino effects in case of failures by preserving a consistent global checkpoint on stable storage. However, ...