191 search results - page 35 / 39 » Specifying and Reasoning About Dynamic Access-Control Polici... |
LCTRTS
2001
Springer
14 years 3 days ago
2001
Springer
1 COTS (commercial off-the-shelf) devices are capable of executing powerful, distributed algorithms. Very large, adaptive systems can be created by simply integrating these devices...
POPL
2005
ACM
14 years 8 months ago
2005
ACM
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
POPL
2004
ACM
14 years 8 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
POPL
2003
ACM
14 years 8 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
SIGADA
2004
Springer
14 years 1 months ago
2004
Springer
Existing security models require that information of a given security level be prevented from “leaking” into lower-security information. High-security applications must be dem...