534 search results - page 37 / 107 » Proving Termination of Rewrite Systems Using Bounds |
JACM
2007
13 years 7 months ago
2007
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
ITP
2010
13 years 11 months ago
2010
Abstract. Rippling is a heuristic used to guide rewriting and is typically used for inductive theorem proving. We introduce a method to support case-analysis within rippling. Like ...
ENTCS
2008
13 years 7 months ago
2008
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
This paper considers the multi-input multi-output (MIMO) relay channel where multiple antennas are employed by each terminal. Compared to single-input singleoutput (SISO) relay ch...