45 search results - page 4 / 9 » Non-Interference in Constructive Authorization Logic |
JACM
2000
15 years 5 days ago
2000
We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called ...
96
Voted
ESORICS
2000
Springer
15 years 4 months ago
2000
Springer
We extend the logic and semantics of authorization due to Abadi, Lampson, et al. to support restricted delegation. Our formal model provides a simple interpretation for the variety...
153
click to vote
COLT
1994
Springer
15 years 4 months ago
1994
Springer
Inductive Logic Programming (ILP) involves the construction of first-order definite clause theories from examples and background knowledge. Unlike both traditional Machine Learnin...
89
Voted
AMAI
2000
Springer
15 years 6 days ago
2000
Springer
An event space is a set of instantaneous events that vary both in time and specificity. The concept of an event space provides a foundation for a logical--i.e., modular and open-a...
112
Voted
LOPSTR
1997
Springer
15 years 4 months ago
1997
Springer
Schema-based program transformation [8] has been proposed as an effective technique for the optimisation of logic programs. Schemata are applied to a logic program, mapping ineffi...