13306 search results - page 427 / 2662 » Theoretical Computer Science |
177
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
198
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
We show that, contrary to the situation in first-order term rewriting, almost none of the usual properties of rewriting are modular for higher-order rewriting, irrespective of the...
144
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is ...
182
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are pol...
160
click to vote
EXPCS
2007
15 years 10 months ago
2007
The modeling of power and thermal behavior of processors requires challenging validation processes, which may be complex and undependable. In order to ameliorate some of the diffi...