1700 search results - page 239 / 340 » Specifying and implementing refactorings |
163
click to vote
PKC
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. In a distributed system, dynamically dividing execution between nodes is essential for service robustness. However, when all of the nodes cannot be equally trusted, and w...
133
click to vote
ISCA
1998
IEEE
15 years 10 months ago
1998
IEEE
A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory ac...
166
click to vote
VLDB
1999
ACM
15 years 10 months ago
1999
ACM
We present a pipelining, dynamically usercontrollable reorder operator, for use in dataintensive applications. Allowing the user to reorder the data delivery on the fly increases...
151
click to vote
KBSE
1998
IEEE
15 years 10 months ago
1998
IEEE
Most efforts to automate formal verification of communicating systems have centred around finite-state systems (FSSs). However, FSSs are incapable of modelling many practical comm...
148
click to vote
AMAST
1998
Springer
15 years 10 months ago
1998
Springer
The goal of this paper is to develop an algebraic theory of process scheduling. We specify a syntax for denoting processes composed of actions with given durations. Subsequently, w...