65 search results - page 11 / 13 » Termination orders for 3-dimensional rewriting |
CADE
2003
Springer
15 years 10 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 ...
COLING
1992
14 years 11 months ago
1992
In machine translation (MT) dierent levels of representation can be used to translate a source language sentence onto its target language equivalent. These levels have to be relat...
PPDP
2005
Springer
15 years 3 months ago
2005
Springer
We address the problem of controlling information leakage in a concurrent declarative programming setting. Our aim is to define verification tools in order to distinguish betwee...
CSL
2007
Springer
15 years 3 months ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
RTA
2007
Springer
15 years 3 months ago
2007
Springer
The third Termination Competition took place in June 2006. We present the background, results and conclusions of this competition. 1 Motivation and history In the past decades seve...