440 search results - page 56 / 88 » Local reasoning for abstraction and sharing |
ENTCS
2006
15 years 1 months ago
2006
Capability passing processes model global applications in a way that decouples the global agreement aspects of protocols from the details of how the communications are actually ma...
140
click to vote
ECCC
2011
14 years 5 months ago
2011
Abstract. Given an LLL-basis B of dimension n = hk we accelerate slide-reduction with blocksize k to run under a reasonable assumption within 1 6 n2 h log1+ε α local SVP-computat...
102
click to vote
DEXAW
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—The k-means method is a simple and fast clustering technique that exhibits the problem of specifying the optimal number of clusters preliminarily. We address the problem...
226
click to vote
POPL
2007
ACM
16 years 2 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
141
click to vote
HICSS
2003
IEEE
15 years 7 months ago
2003
IEEE
We examine a knowledge representation architecture to support context interchange mediation. For autonomous receivers and sources sharing a common subject domain, the mediator’s...