196 search results - page 30 / 40 » concurrency 1998 |
IEEEPACT
1998
IEEE
14 years 2 months ago
1998
IEEE
Conventional speculative architectures use branch prediction to evaluate the most likely execution path during program execution. However, certain branches are difficult to predic...
ISORC
1998
IEEE
14 years 2 months ago
1998
IEEE
Traditionally transactions have been singlethreaded. In such an environment the thread terminating the transaction is, by definition, the thread which performed the work. Therefor...
ISSTA
1998
ACM
14 years 2 months ago
1998
ACM
Symbolic model checking has proved highly successful for large nite-state systems, in which states can be compactly encoded using binary decision diagrams (BDDs) or their variants...
POPL
1998
ACM
14 years 2 months ago
1998
ACM
Previously, we developed a type system to ensure secure information flow in a sequential, imperative programming language [VSI96]. Program variables are classified as either hig...
DEXA
1998
Springer
14 years 2 months ago
1998
Springer
We discuss and prove the correctness of a transaction model for mobile computing. In our transaction model, we incorporate a prewrite operation (before a write) which does not upda...