Pages that link to "Item:Q3454084"
From MaRDI portal
The following pages link to Termination Competition (termCOMP 2015) (Q3454084):
Displaying 6 items.
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Constant runtime complexity of term rewriting is semi-decidable (Q1799562) (← links)
- A Perron-Frobenius theorem for deciding matrix growth (Q2239274) (← links)
- A verified implementation of algebraic numbers in Isabelle/HOL (Q2303244) (← links)
- Termination of Cycle Rewriting by Transformation and Matrix Interpretation (Q2980975) (← links)
- From Outermost to Context-Sensitive Rewriting (Q3636831) (← links)