Sciweavers

5344 search results - page 320 / 1069
» Privacy-Preserving Set Operations
Sort
View
PODC
2010
ACM
15 years 8 months ago
Verifying linearizability with hindsight
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev,...
LCPC
1995
Springer
15 years 8 months ago
V-cal: A Calculus for the Compilation of Data Parallel Languages
V-cal is a calculus designed to support the compilation of data parallel languages that allows to describe program transformations and optimizations as semantics preserving rewrite...
P. F. G. Dechering, J. A. Trescher, J. P. M. de Vr...
LICS
1991
IEEE
15 years 8 months ago
Defaults and Revision in Structured Theories
Starting from a logic which speci es how to make deductions from a set of sentences (a ` at theory'), a way to generalise this toa partiallyordered bag ofsentences (a `struct...
Mark Ryan
VLDB
1991
ACM
126views Database» more  VLDB 1991»
15 years 8 months ago
Deriving Production Rules for Incremental View Maintenance
It is widely recognized that production rules in database systems can be used to automatically maintain derived data such as views. However, writing a correct set of rules for e ci...
Stefano Ceri, Jennifer Widom
COMPSAC
2009
IEEE
15 years 7 months ago
Cartesian Programming: The TransLucid Programming Language
Abstract. The TransLucid programming language is a low-level intensional language, designed to be sufficiently rich for it to be the target language for translating the common prog...
John Plaice, Blanca Mancilla