309 search results - page 7 / 62 » Termination proofs for systems code |
TISSEC
2002
13 years 7 months ago
2002
Language runtime systems are increasingly being embedded in systems to support runtime extensibility via mobile code. Such systems raise a number of concerns when the code running...
FSTTCS
2006
Springer
13 years 11 months ago
2006
Springer
Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of co...
CSL
2009
Springer
14 years 2 months ago
2009
Springer
We investigate the relationship between two independently developed termination techniques for rst and higher-order rewrite systems. On the one hand, sized-types based termination...
APAL
2008
13 years 7 months ago
2008
A simple cut elimination proof for arithmetic with epsilon symbol is used to establish termination of a modified epsilon substitution process. This opens a possibility of extensio...
DAGSTUHL
2007
13 years 9 months ago
2007
Abstract. The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems. We first show that dependency pairs are also suitabl...