362 search results - page 1 / 73 » Mechanizing and Improving Dependency Pairs |
JAR
2006
13 years 7 months 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 ...
ADHOCNOW
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. The Bluetooth wireless technology realizes a low-cost shortrange wireless voice- and data-connection through radio propagation. Bluetooth also has a security architecture...
CADE
2004
Springer
14 years 26 days 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...
ANTS
2004
Springer
14 years 26 days ago
2004
Springer
We present algorithms for computing the squared Weil and Tate pairings on an elliptic curve and the squared Tate pairing for hyperelliptic curves. The squared pairings introduced i...
CSL
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...