Sciweavers

268 search results - page 53 / 54
» Expressive Power of Grammatical Formalisms
Sort
View
CIDR
2009
119views Algorithms» more  CIDR 2009»
13 years 6 months ago
DBMSs Should Talk Back Too
Natural language user interfaces to database systems have been studied for several decades now. They have mainly focused on parsing and interpreting natural language queries to ge...
Alkis Simitsis, Yannis E. Ioannidis
ENTCS
2006
146views more  ENTCS 2006»
13 years 5 months ago
Relating State-Based and Process-Based Concurrency through Linear Logic
This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones. Concurrent and distributed systems are noto...
Iliano Cervesato, Andre Scedrov
TCS
2002
13 years 5 months ago
Authentication tests and the structure of bundles
Suppose a principal in a cryptographic protocol creates and transmits a message containing a new value v, later receiving v back in a different cryptographic context. It can concl...
Joshua D. Guttman, F. Javier Thayer
SP
2010
IEEE
152views Security Privacy» more  SP 2010»
13 years 3 months ago
Scalable Parametric Verification of Secure Systems: How to Verify Reference Monitors without Worrying about Data Structure Size
The security of systems such as operating systems, hypervisors, and web browsers depend critically on reference monitors to correctly enforce their desired security policy in the ...
Jason Franklin, Sagar Chaki, Anupam Datta, Arvind ...
ECCC
2011
223views ECommerce» more  ECCC 2011»
13 years 18 days ago
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena