Pages that link to "Item:Q2938069"
From MaRDI portal
The following pages link to Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops (Q2938069):
Displaying 7 items.
- Reachability problems on reliable and lossy queue automata (Q825976) (← links)
- Taming past LTL and flat counter systems (Q2346416) (← links)
- Equivalence between model-checking flat counter systems and Presburger arithmetic (Q2636509) (← links)
- Interprocedural Reachability for Flat Integer Programs (Q2947875) (← links)
- Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic (Q3447697) (← links)
- (Q5129947) (← links)
- Verification of Flat FIFO Systems (Q5875373) (← links)
