1445 search results - page 93 / 289 » Uniformly Hard Languages |
APPROX
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
PLDI
2011
ACM
13 years 1 months ago
2011
ACM
When dealing with dynamic, untrusted content, such as on the Web, software behavior must be sandboxed, typically through use of a language like JavaScript. However, even for such ...
ICDE
2006
IEEE
14 years 11 months ago
2006
IEEE
Linguistic research and natural language processing employ large repositories of ordered trees. XML, a standard ordered tree model, and XPath, its associated language, are natural...
LPNMR
2007
Springer
14 years 4 months ago
2007
Springer
Practically all programming languages used in software engineering allow to split a program into several modules. For fully declarative and nonmonotonic logic programming languages...
IFIP
2004
Springer
14 years 3 months ago
2004
Springer
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...