Sciweavers

443 search results - page 38 / 89
» Relations in Concurrency
Sort
View
WWW
2004
ACM
16 years 6 months ago
Time-based contextualized-news browser (t-cnb)
We propose a new way of browsing contextualized-news articles. Our prototype browser system is called a Time-based ContextualizedNews Browser (T-CNB). The T-CNB concurrently and a...
Akiyo Nadamoto, Katsumi Tanaka
SPDP
1993
IEEE
15 years 9 months ago
How to Share an Object: A Fast Timing-Based Solution
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
Rajeev Alur, Gadi Taubenfeld
HASKELL
2009
ACM
16 years 1 days ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
SBBD
2004
137views Database» more  SBBD 2004»
15 years 6 months ago
A Lock Manager for Collaborative Processing of Natively Stored XML Documents
Today, neither transactional provisions, in general, nor concurrency control, in particular, of DBMS-based processing are tailored to the specific needs of large and collaborative...
Michael Peter Haustein, Theo Härder
AGP
1995
IEEE
15 years 9 months ago
Domain Independent Ask Approximation in CCP
The main difficulty in the formalization of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constrai...
Enea Zaffanella