565 search results - page 102 / 113 » A logic for authorization provenance |
CADE
1998
Springer
14 years 1 months ago
1998
Springer
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...
POPL
1998
ACM
14 years 1 months ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
PODC
1994
ACM
14 years 1 months ago
1994
ACM
The notion of belief has been useful in reasoning about authentication protocols. In this paper, we show how the notion of belief can be applied to reasoning about cache coherence...
ERSHOV
2009
Springer
14 years 25 days ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
BIRTHDAY
1991
Springer
14 years 14 days ago
1991
Springer
The goal of the MKRP project is the development of a theorem prover which can be used as an inference engine in various applications, in particular it should be capable of proving ...