Sciweavers

3819 search results - page 173 / 764
» Simple Easy Terms
Sort
View
JAL
2002
86views more  JAL 2002»
15 years 6 months ago
Exploiting structure in quantified formulas
We study the computational problem "find the value of the quantified formula obtained by quantifying the variables in a sum of terms." The "sum" can be based o...
Richard Edwin Stearns, Harry B. Hunt III
RTA
2011
Springer
14 years 9 months ago
Maximal Completion
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient compl...
Dominik Klein, Nao Hirokawa
212
Voted
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
14 years 9 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli
SIGSOFT
2006
ACM
16 years 7 months ago
SYNERGY: a new algorithm for property checking
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
Bhargav S. Gulavani, Thomas A. Henzinger, Yamini K...
WWW
2006
ACM
16 years 7 months ago
SecuBat: a web vulnerability scanner
As the popularity of the web increases and web applications become tools of everyday use, the role of web security has been gaining importance as well. The last years have shown a...
Christopher Krügel, Engin Kirda, Nenad Jovano...