Pages that link to "Item:Q5308459"
From MaRDI portal
The following pages link to Foundations of Software Science and Computation Structures (Q5308459):
Displaying 11 items.
- Relaxing monotonicity for innermost termination (Q835006) (← links)
- Mechanically proving termination using polynomial interpretations (Q851142) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Tyrolean termination tool: techniques and features (Q876042) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- A term rewriting characterization of the functions computable in polynomial space (Q1407521) (← links)
- Proving operational termination of membership equational programs (Q2271899) (← links)
- Algorithms with polynomial interpretation termination proof (Q2740985) (← links)
- Proving termination of context-sensitive rewriting with MU-TERM (Q2867963) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
- Deciding Polynomial Termination Complexity for VASS Programs (Q6176114) (← links)