Sciweavers

17 search results - page 2 / 4
» How Much Non-Strictness do Lenient Programs Require
Sort
View
IFIP
2004
Springer
13 years 10 months ago
An Interactive Trust Management and Negotiation Scheme
Interactive access control allows a server to compute and communicate on the fly the missing credentials to a client and to adapt its responses on the basis of presented and decli...
Hristo Koshutanski, Fabio Massacci
DLS
2005
148views Languages» more  DLS 2005»
13 years 6 months ago
Compile-time meta-programming in a dynamically typed OO language
Compile-time meta-programming allows programs to be constructed by the user at compile-time. Although LISP derived languages have long had such facilities, few modern languages ar...
Laurence Tratt
MOZ
2004
Springer
13 years 10 months ago
The Structure of Authority: Why Security Is Not a Separable Concern
Common programming practice grants excess authority for the sake of functionality; programming principles require least authority for the sake of security. If we practice our princ...
Mark S. Miller, Bill Tulloh, Jonathan S. Shapiro
ATAL
2003
Springer
13 years 10 months ago
Constructing optimal policies for agents with constrained architectures
Optimal behavior is a very desirable property of autonomous agents and, as such, has received much attention over the years. However, making optimal decisions and executing optima...
Dmitri A. Dolgov, Edmund H. Durfee
ISCA
1998
IEEE
143views Hardware» more  ISCA 1998»
13 years 9 months ago
Lockup-Free Instruction Fetch/Prefetch Cache Organization
In the past decade. there has been much literature describing various cache organizatrons that exploit general programming idiosyncrasies to obtain maxrmum hit rate (the probabili...
David Kroft