Pages that link to "Item:Q2931783"
From MaRDI portal
The following pages link to On the linear ranking problem for integer linear-constraint loops (Q2931783):
Displaying 9 items.
- Algebraic model checking for discrete linear dynamical systems (Q2112097) (← links)
- \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs (Q2119987) (← links)
- How to find the convex hull of all integer points in a polyhedron? (Q2162699) (← links)
- Termination of Single-Path Polynomial Loop Programs (Q3179389) (← links)
- Proving Termination Through Conditional Termination (Q3303892) (← links)
- (Q5092319) (← links)
- Ranking Functions for Linear-Constraint Loops (Q5501930) (← links)
- On lexicographic proof rules for probabilistic termination (Q6610383) (← links)
- Termination analysis of programs with multiphase control-flow (Q6647299) (← links)
