Sciweavers

2181 search results - page 90 / 437
» The restriction scaffold problem
Sort
View
ACL
2010
13 years 8 months ago
A Transition-Based Parser for 2-Planar Dependency Structures
Finding a class of structures that is rich enough for adequate linguistic representation yet restricted enough for efficient computational processing is an important problem for d...
Carlos Gómez-Rodríguez, Joakim Nivre
FSTTCS
2010
Springer
13 years 8 months ago
Model Checking Concurrent Programs with Nondeterminism and Randomization
For concurrent probabilistic programs having process-level nondeterminism, it is often necessary to restrict the class of schedulers that resolve nondeterminism to obtain sound an...
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
SAT
2009
Springer
121views Hardware» more  SAT 2009»
14 years 4 months ago
The Complexity of Reasoning for Fragments of Default Logic
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σp 2-complete, an...
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heri...
ICDCS
2002
IEEE
14 years 2 months ago
The Complexity of Adding Failsafe Fault-Tolerance
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
Sandeep S. Kulkarni, Ali Ebnenasir
TDSC
2008
152views more  TDSC 2008»
13 years 9 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...