SPAA
1998
ACM
13 years 12 months ago
1998
ACM
We present a computation-centric theory of memory models. Unlike traditional processor-centric models, computation-centric models focus on the logical dependencies among instructi...
SPAA
1998
ACM
13 years 12 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
SPAA
1998
ACM
13 years 12 months ago
1998
ACM
SPAA
1998
ACM
13 years 12 months ago
1998
ACM
CONCUR
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. This paper introduces a compositional Hoare logics for reasoning about the correctness of systems composed of a dynamically evolving collection of processes (also called ...
CONCUR
1998
Springer
13 years 12 months ago
1998
Springer
CONCUR
1998
Springer
13 years 12 months ago
1998
Springer
The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of universal coalgebr...
CONCUR
1998
Springer
13 years 12 months ago
1998
Springer
This paper presents a complete axiomatization of two decidable propositional realtime linear temporal logics: Event Clock Logic (EventClockTL) and Metric Interval Temporal Logic w...
CONCUR
1998
Springer
13 years 12 months ago
1998
Springer
CONCUR
1998
Springer
13 years 12 months ago
1998
Springer
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest viewing PA-processes as trees, and using treeautomata technique...