309 search results - page 8 / 62 » Termination proofs for systems code |
CADE
1992
Springer
13 years 11 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— Cooperative relaying is a promising alternative for conventional mobile communications systems as it is able to increase coverage and throughput of these systems. Due to practi...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
Channel coding is a key element of any digital wireless communication system since it minimizes the effects of noise and interference on the transmitted signal. In thirdgeneration...
LICS
1991
IEEE
13 years 11 months ago
1991
IEEE
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...
IANDC
2007
13 years 7 months ago
2007
The Tyrolean Termination Tool (TTT for short) is a powerful tool for automatically proving termination of rewrite systems. It incorporates several new refinements of the dependen...