Sciweavers

1220 search results - page 147 / 244
» Restricting grammatical complexity
Sort
View
CADE
2008
Springer
14 years 8 months ago
Model Stack for the Pervasive Verification of a Microkernel-based Operating System
Abstract. Operating-system verification gains increasing research interest. The complexity of such systems is, however, challenging and many endeavors are limited in some respect: ...
Jan Dörrenbächer, Matthias Daum, Sebasti...
CADE
2006
Springer
14 years 8 months ago
Stratified Context Unification Is NP-Complete
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
STOC
2005
ACM
142views Algorithms» more  STOC 2005»
14 years 8 months ago
Market equilibrium via the excess demand function
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
Bruno Codenotti, Benton McCune, Kasturi R. Varadar...
PODS
2001
ACM
85views Database» more  PODS 2001»
14 years 8 months ago
On XML Integrity Constraints in the Presence of DTDs
The paper investigates XML document speci cations with DTDs and integrity constraints, such as keysand foreign keys. We study the consistency problem of checking whether a given s...
Wenfei Fan, Leonid Libkin
PODS
2003
ACM
118views Database» more  PODS 2003»
14 years 8 months ago
Numerical document queries
A query against a database behind a site like Napster may search, e.g., for all users who have downloaded more jazz titles than pop music titles. In order to express such queries,...
Helmut Seidl, Thomas Schwentick, Anca Muscholl