534 search results - page 40 / 107 » Proving Termination of Rewrite Systems Using Bounds |
132
Voted
FLOPS
2008
Springer
15 years 5 months ago
2008
Springer
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
129
click to vote
PODC
2009
ACM
16 years 4 months ago
2009
ACM
In 2004, Klavins et al. introduced the use of graph grammars to describe--and to program--systems of self-assembly. It turns out that these graph grammars can be embedded in a gra...
134
click to vote
ANCS
2006
ACM
15 years 10 months ago
2006
ACM
The fast spreading worm is becoming one of the most serious threats to today’s networked information systems. A fast spreading worm could infect hundreds of thousands of hosts w...
122
click to vote
GMP
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract. The need for robust solutions for sets of non-linear multivariate constraints or equations needs no motivation. Subdivision-based multivariate constraint solvers [1–3] ...
155
click to vote
CAV
2001
Springer
15 years 7 months ago
2001
Springer
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...