1147 search results - page 73 / 230 » Termination in language-based systems |
CORR
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for term...
CADE
2007
Springer
14 years 10 months ago
2007
Springer
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...
ICARIS
2005
Springer
14 years 3 months ago
2005
Springer
The (randomized) real-valued negative selection algorithm is an anomaly detection approach, inspired by the negative selection immune system principle. The algorithm was proposed t...
ISCAS
1999
IEEE
14 years 2 months ago
1999
IEEE
We study the weight dynamics of the floating-gate pFET synapse and the effects of the pFET's gate and drain voltages on these dynamics. We show that we can derive a weight upd...
OPODIS
2003
13 years 11 months ago
2003
In this paper, we give an efficient algorithm to determine whether a locally stable predicate has become true in an underlying computation. Examples of locally stable predicates in...