444 search results - page 28 / 89 » Termination by Abstraction |
RTA
2010
Springer
14 years 1 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...
GECCO
2008
Springer
13 years 10 months ago
2008
Springer
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
RTA
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
ICC
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract— The concept of cognitive radio (or secondary spectrum access) is currently under investigation as a promising paradigm to achieve efficient use of the frequency resour...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track ...