5269 search results - page 877 / 1054 » order 2007 |
285
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
180
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
271
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
In previous papers [SC05, SBC+07], some of us predicted the end of "one size fits all" as a commercial relational DBMS paradigm. These papers presented reasons and exper...
254
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Sketching techniques can provide approximate answers to aggregate queries either for data-streaming or distributed computation. Small space summaries that have linearity propertie...
154
click to vote
SOSP
2007
ACM
16 years 3 months ago
2007
ACM
Reliable storage systems depend in part on “write-before” relationships where some changes to stable storage are delayed until other changes commit. A journaled file system, ...