2227 search results - page 89 / 446 » Reversibility and Models for Concurrency |
STOC
1998
ACM
14 years 2 months ago
1998
ACM
Abstract. Loosely speaking, an interactive proof is said to be zeroknowledge if the view of every “efficient” verifier can be “efficiently” simulated. An outstanding open ...
SIGMOD
1993
ACM
14 years 2 months ago
1993
ACM
In a research and technology applicationproject at Bellcore, we used multidatabase transactions to model multisystem workflows of telecommunication applications. During the projec...
ENTCS
2007
13 years 10 months ago
2007
In this paper we present our rst approach to model and verify biological systems using ntcc, a concurrent constraint process calculus. We argue that the partial information const...
WOTUG
2007
13 years 11 months ago
2007
Concurrency control mechanisms such as turn-taking, locking, serialization, transactional locking mechanism, and operational transformation try to provide data consistency when con...
SAC
2009
ACM
14 years 4 months ago
2009
ACM
Parallel architectures are the way of the future, but are notoriously difficult to program. In addition to the low-level constructs they often present (e.g., locks, DMA, and non-...