186 search results - page 25 / 38 » Tractability of Theory Patching |
193
click to vote
POPL
2005
ACM
15 years 10 months ago
2005
ACM
In traditional information-flow type systems, the security policy is often formalized as noninterference properties. However, noninterference alone is too strong to express securi...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We propose a natural, mathematically tractable model of TCP which captures both its additive-increase, multiplicative-decrease behavior and its feedback mechanism. Neither a fluid...
PODS
2008
ACM
15 years 10 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
ICFP
2008
ACM
15 years 10 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...
106
click to vote
LICS
2007
IEEE
15 years 4 months ago
2007
IEEE
The combination of first-order epistemic logic and formal cryptography offers a potentially very powerful framework for security protocol verification. In this article, we addre...