417 search results - page 41 / 84 » Orderings for Innermost Termination |
CADE
2003
Springer
14 years 8 months ago
2003
Springer
Developing automatable methods for proving termination of term rewrite systems that resist traditional techniques based on simplification orders has become an active research area ...
NSF
2001
Springer
14 years 2 days ago
2001
Springer
With the proliferation of 2G and 3G Telecom and other wireless networks hundred of millions of users will be able to access wireless services with their terminals in only a few yea...
FLOPS
2006
Springer
13 years 11 months ago
2006
Springer
We propose a new method to control memory resources by static analysis. For this, we introduce the notion of sup-interpretation which bounds from above the size of function outputs...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
JCM
2006
13 years 7 months ago
2006
In established communication systems prices are determined in a quasi-static way and for a large area according to a fixed price model. Additionally, the main decision criteria of ...