Sciweavers

1004 search results - page 106 / 201
» Safe Constraint Queries
Sort
View
POPL
2010
ACM
13 years 11 months ago
Programming with angelic nondeterminism
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...
Rastislav Bodík, Satish Chandra, Joel Galen...
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 9 months ago
Mining broad latent query aspects from search sessions
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...
Xuanhui Wang, Deepayan Chakrabarti, Kunal Punera
FQAS
2006
Springer
186views Database» more  FQAS 2006»
14 years 15 days ago
Project-Join-Repair: An Approach to Consistent Query Answering Under Functional Dependencies
Consistent query answering is the term commonly used for the problem of answering queries on databases that violate certain integrity constraints. We address this problem for univ...
Jef Wijsen
ISSTA
2010
ACM
14 years 22 days ago
Proving memory safety of floating-point computations by combining static and dynamic program analysis
Whitebox fuzzing is a novel form of security testing based on dynamic symbolic execution and constraint solving. Over the last couple of years, whitebox fuzzers have found many ne...
Patrice Godefroid, Johannes Kinder
ICDE
2009
IEEE
210views Database» more  ICDE 2009»
14 years 10 months ago
Keyword Search in Spatial Databases: Towards Searching by Document
This work addresses a novel spatial keyword query called the m-closest keywords (mCK) query. Given a database of spatial objects, each tuple is associated with some descriptive inf...
Dongxiang Zhang, Yeow Meng Chee, Anirban Mondal, A...