Pages that link to "Item:Q6194959"
From MaRDI portal
The following pages link to Termination of triangular Integer loops is decidable (Q6194959):
Displayed 5 items.
- Reflections on termination of linear loops (Q832249) (← links)
- Automatic complexity analysis of integer programs via triangular weakly non-linear loops (Q2104561) (← links)
- Automatic discovery of fair paths in infinite-state transition systems (Q2147176) (← links)
- Proving the existence of fair paths in infinite-state systems (Q2234061) (← links)
- Computing expected runtimes for constant probability programs (Q2305420) (← links)