534 search results - page 54 / 107 » Proving Termination of Rewrite Systems Using Bounds |
110
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
114
Voted
CORR
2009
Springer
15 years 1 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
117
Voted
APLAS
2005
ACM
15 years 9 months ago
2005
ACM
Affine size-change analysis has been used for termination analysis of eager functional programming languages. The same style of analysis is also capable of compactly recording and ...
130
Voted
DLT
2010
15 years 5 months ago
2010
Abstract. We prove that uniform and semi-uniform families of P systems with active membranes using only communication and nonelementary division rules are not computationally unive...
136
Voted
CONCUR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We propose a new operational model for shared variable concurrency, in the context of a concurrent, higher-order imperative language `a la ML. In our model the scheduling...