906 search results - page 56 / 182 » Linking Theories of Concurrency |
133
click to vote
HT
2004
ACM
15 years 11 months ago
2004
ACM
In this paper we identify a common aim between ubiquitous computing and hypertext systems: the desire to present navigable, located and structured information. We propose that exi...
257
click to vote
POPL
2009
ACM
16 years 6 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
124
click to vote
ENTCS
2007
15 years 6 months ago
2007
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
168
click to vote
JLP
2010
15 years 28 days ago
2010
The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner's SCCS calculus. The resulting algebraic structure ...
215
click to vote
EDBT
2012
ACM
13 years 8 months ago
2012
ACM
Many stream processing applications require access to a multitude of streaming as well as stored data sources. Yet there is no clear semantics for correct continuous query executi...