Sciweavers

3384 search results - page 580 / 677
» More Testable Properties
Sort
View
CADE
2007
Springer
14 years 9 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
14 years 9 months ago
Sublinear algorithms for testing monotone and unimodal distributions
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld
OSDI
2006
ACM
14 years 9 months ago
From Uncertainty to Belief: Inferring the Specification Within
Automatic tools for finding software errors require a set of specifications before they can check code: if they do not know what to check, they cannot find bugs. This paper presen...
Ted Kremenek, Paul Twohey, Godmar Back, Andrew Y. ...
VLDB
2008
ACM
170views Database» more  VLDB 2008»
14 years 9 months ago
A multi-ranker model for adaptive XML searching
The evolution of computing technology suggests that it has become more feasible to offer access to Web information in a ubiquitous way, through various kinds of interaction device...
Ho Lam Lau, Wilfred Ng
VLDB
2008
ACM
136views Database» more  VLDB 2008»
14 years 9 months ago
Efficient updates in dynamic XML data: from binary string to quaternary string
XML query processing based on labeling schemes has been thoroughly studied in the past several years. Recently efficient processing of updates in dynamic XML data has gained more a...
Changqing Li, Tok Wang Ling, Min Hu