Sciweavers

247 search results - page 41 / 50
» Ideals without CCC
Sort
View
CODES
2004
IEEE
13 years 11 months ago
Operation tables for scheduling in the presence of incomplete bypassing
Register bypassing is a powerful and widely used feature in modern processors to eliminate certain data hazards. Although complete bypassing is ideal for performance, bypassing ha...
Aviral Shrivastava, Eugene Earlie, Nikil D. Dutt, ...
CCS
2006
ACM
13 years 11 months ago
RoleMiner: mining roles using subset enumeration
Role engineering, the task of defining roles and associating permissions to them, is essential to realize the full benefits of the role-based access control paradigm. Essentially,...
Jaideep Vaidya, Vijayalakshmi Atluri, Janice Warne...
FOCS
2004
IEEE
13 years 11 months ago
Universally Composable Protocols with Relaxed Set-Up Assumptions
A desirable goal for cryptographic protocols is to guarantee security when the protocol is composed with other protocol instances. Universally Composable (UC) protocols provide th...
Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafa...
FAST
2008
13 years 9 months ago
Portably Solving File TOCTTOU Races with Hardness Amplification
The file-system API of contemporary systems makes programs vulnerable to TOCTTOU (time of check to time of use) race conditions. Existing solutions either help users to detect the...
Dan Tsafrir, Tomer Hertz, David Wagner, Dilma Da S...
CP
2008
Springer
13 years 9 months ago
Model Restarts for Structural Symmetry Breaking
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
Daniel S. Heller, Aurojit Panda, Meinolf Sellmann,...