22 search results - page 1 / 5 » The Dependency Pair Framework: Combining Techniques for Auto... |
155
Voted
LPAR
2004
Springer
15 years 5 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
82
Voted
CADE
2006
Springer
16 years 22 days ago
2006
Springer
115
Voted
CADE
2004
Springer
15 years 5 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
110
Voted
JAR
2006
15 years 11 days ago
2006
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
106
Voted
AAECC
2005
Springer
15 years 10 days ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...