Sciweavers

1724 search results - page 212 / 345
» Models for Concurrency
Sort
View
STOC
2002
ACM
159views Algorithms» more  STOC 2002»
15 years 10 months ago
On the composition of authenticated byzantine agreement
A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine...
Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
APLAS
2009
ACM
15 years 4 months ago
A Fresh Look at Separation Algebras and Share Accounting
Separation Algebras serve as models of Separation Logics; Share Accounting allows reasoning about concurrent-read/exclusive-write resources in Separation Logic. In designing a Conc...
Robert Dockins, Aquinas Hobor, Andrew W. Appel
APSEC
1995
IEEE
15 years 1 months ago
Development of Distributed Applications with Separation of Concerns
The development of distributed applications is an open area involving researchers from different communities. We propose an object-oriented approach to the development of distribu...
António Rito Silva, Pedro Sousa, José...
SIAMCOMP
1998
117views more  SIAMCOMP 1998»
14 years 9 months ago
The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
This paper introduces the queue-read, queue-write (qrqw) parallel random access machine (pram) model, which permits concurrent reading and writing to shared memory locations, but ...
Phillip B. Gibbons, Yossi Matias, Vijaya Ramachand...
CCGRID
2006
IEEE
15 years 4 months ago
Component-Based Modeling, Analysis and Animation
Component-based software construction is widely used in a variety of applications, from embedded environments to grid computing. However, errors in these applications and systems ...
Jeff Kramer