1101 search results - page 176 / 221 » Forcing in proof theory |
104
Voted
CADE
2008
Springer
16 years 4 months ago
2008
Springer
Abstract. Operating-system verification gains increasing research interest. The complexity of such systems is, however, challenging and many endeavors are limited in some respect: ...
158
Voted
STOC
2004
ACM
16 years 4 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
116
Voted
STOC
2003
ACM
16 years 4 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
138
Voted
ICFP
2008
ACM
16 years 3 months ago
2008
ACM
This paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic co...
132
Voted
ICFP
2008
ACM
16 years 3 months ago
2008
ACM
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...