Sciweavers

7228 search results - page 1058 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
SIGSOFT
2009
ACM
16 years 5 months ago
Symbolic pruning of concurrent program executions
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
Chao Wang, Swarat Chaudhuri, Aarti Gupta, Yu Yang
152
Voted
SIGSOFT
2009
ACM
16 years 5 months ago
Engineering search computing applications: vision and challenges
Search computing is a novel discipline whose goal is to answer complex, multi-domain queries. Such queries typically require combining in their results domain knowledge extracted ...
Marco Brambilla, Stefano Ceri
SIGSOFT
2008
ACM
16 years 5 months ago
Automatically locating framework extension examples
Using and extending a framework is a challenging task whose difficulty is exacerbated by the poor documentation that generally comes with the framework. Even in the presence of do...
Barthélémy Dagenais, Harold Ossher
ICDT
2009
ACM
105views Database» more  ICDT 2009»
16 years 5 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
ICDT
2009
ACM
198views Database» more  ICDT 2009»
16 years 5 months ago
Consistent query answering under primary keys: a characterization of tractable queries
This article deals with consistent query answering to conjunctive queries under primary key constraints. The repairs of an inconsistent database db are obtained by selecting a max...
Jef Wijsen
« Prev « First page 1058 / 1446 Last » Next »