309 search results - page 9 / 62 » Termination proofs for systems code |
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
—Orthogonal variable spreading factor (OVSF) codes are used in both universal terrestrial radio access–frequency division duplex (UTRA-FDD) and time division duplex (UTRA-TDD) ...
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
RTA
2005
Springer
14 years 1 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
LOPSTR
1994
Springer
13 years 11 months ago
1994
Springer
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...