119 search results - page 7 / 24 » Reasoning about Lists via List Interleaving |
SIGMOD
2003
ACM
15 years 10 months ago
2003
ACM
We consider the problem of mapping data in peer-topeer data-sharing systems. Such systems often rely on the use of mapping tables listing pairs of corresponding values to search f...
PKC
2009
Springer
15 years 11 months ago
2009
Springer
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
108
click to vote
ENTCS
2006
14 years 10 months ago
2006
Separation logic [20,21,14] began life as an extended formalisation of Burstall's treatment of list-mutating programs [8]. It rapidly became clear that there was more that it...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We report on work in progress on extracting lexical simplifications (e.g., "collaborate" "work together"), focusing on utilizing edit histories in Simple Engli...
CONCUR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...