While the B-tree (or the B+ -tree) is the most popular index structure in disk-based relational database systems, the Ttree has been widely accepted as a promising index structure...
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explici...
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
Abstract With the rapid advances in mobile computing technology, there is an increasing demand for processing realtime transactions in a mobile environment. This paper studies con...
Kam-yiu Lam, Tei-Wei Kuo, Wai-Hung Tsang, Gary C. ...