A Verified Efficient Implementation of the Weighted Path Order (Q7361076)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Efficient_Weighted_Path_Order
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Verified Efficient Implementation of the Weighted Path Order |
AFP entry Efficient_Weighted_Path_Order |
Statements
1 June 2023
0 references
René Thiemann
0 references
Elias Wenninger
0 references
A Verified Efficient Implementation of the Weighted Path Order (English)
0 references
The Weighted Path Order (WPO) of Yamada is a powerful technique for proving termination. In a previous AFP entry, the WPO was defined and properties of WPO have been formally verified. However, the implementation of WPO was naive, leading to an exponential runtime in the worst case. Therefore, in this AFP entry we provide a poly-time implementation of WPO. The implementation is based on memoization. Since WPO generalizes the recursive path order (RPO), we also easily derive an efficient implementation of RPO.
0 references
