Sciweavers

1220 search results - page 94 / 244
» Restricting grammatical complexity
Sort
View
JCS
2008
109views more  JCS 2008»
13 years 7 months ago
Secrecy for bounded security protocols with freshness check is NEXPTIME-complete
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bound...
Ferucio Laurentiu Tiplea, Catalin V. Birjoveanu, C...
JOLLI
2006
123views more  JOLLI 2006»
13 years 7 months ago
Cut and Pay
Abstract. In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cut-rule and introduce ...
Marcelo Finger, Dov M. Gabbay
JSS
2006
85views more  JSS 2006»
13 years 7 months ago
Effects of context on program slicing
Whether context-sensitive program analysis is more effective than context-insensitive analysis is an ongoing discussion. There is evidence that context-sensitivity matters in comp...
Jens Krinke
TDSC
2008
152views more  TDSC 2008»
13 years 7 months ago
Towards Formal Verification of Role-Based Access Control Policies
Specifying and managing access control policies is a challenging problem. We propose to develop formal verification techniques for access control policies to improve the current s...
Somesh Jha, Ninghui Li, Mahesh V. Tripunitara, Qih...
COLT
2010
Springer
13 years 5 months ago
Forest Density Estimation
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
Anupam Gupta, John D. Lafferty, Han Liu, Larry A. ...