534 search results - page 40 / 107 » Proving Termination of Rewrite Systems Using Bounds |
FLOPS
2008
Springer
13 years 9 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...
PODC
2009
ACM
14 years 8 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...
ANCS
2006
ACM
14 years 1 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...
GMP
2006
IEEE
14 years 1 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] ...
CAV
2001
Springer
13 years 11 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...