1445 search results - page 93 / 289 » Uniformly Hard Languages |
127
Voted
APPROX
2006
Springer
15 years 7 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...
131
Voted
PLDI
2011
ACM
14 years 6 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 ...
213
Voted
ICDE
2006
IEEE
16 years 5 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...
127
Voted
LPNMR
2007
Springer
15 years 9 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...
147
Voted
IFIP
2004
Springer
15 years 9 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...