142 search results - page 7 / 29 » Proving Termination by Invariance Relations |
SAS
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Linear-relations analysis of transition systems discovers linear invariant relationships among the variables of the system. These relationships help establish important s...
CADE
2001
Springer
14 years 10 months ago
2001
Springer
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
TOPLAS
2008
13 years 9 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
SAS
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
PR
2000
13 years 9 months ago
2000
The problem of the independence and completeness of rotation moment invariants is addressed in this paper. First, a general method for constructing invariants of arbitrary orders ...