518 search results - page 69 / 104 » Automating Proofs in Category Theory |
182
click to vote
POPL
2004
ACM
16 years 3 days ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
119
click to vote
STOC
2004
ACM
16 years 3 days 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, ...
ICFP
2008
ACM
15 years 11 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...
ICFP
2008
ACM
15 years 11 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...
MOBIHOC
2008
ACM
15 years 11 months ago
2008
ACM
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...