Pages that link to "Item:Q2891402"
From MaRDI portal
The following pages link to On the Termination of Integer Loops (Q2891402):
Displaying 7 items.
- A type-based complexity analysis of object oriented programs (Q1640983) (← links)
- Termination of polynomial loops (Q2233526) (← links)
- Non-termination Sets of Simple Linear Loops (Q2915099) (← links)
- Complexity of Restricted Variants of Skolem and Related Problems (Q5111295) (← links)
- On Petri Nets with Hierarchical Special Arcs (Q5111656) (← links)
- Ranking Functions for Linear-Constraint Loops (Q5501930) (← links)
- CONCUR 2005 – Concurrency Theory (Q5897503) (← links)