Pages that link to "Item:Q604395"
From MaRDI portal
The following pages link to Termination of linear programs with nonlinear constraints (Q604395):
Displaying 12 items.
- Recent advances in program verification through computer algebra (Q351971) (← links)
- Symbolic decision procedure for termination of linear programs (Q539162) (← links)
- Termination of polynomial loops (Q2233526) (← links)
- Discovering non-terminating inputs for multi-path polynomial programs (Q2341594) (← links)
- Witness to non-termination of linear programs (Q2357364) (← links)
- A recursive decision method for termination of linear programs (Q2819718) (← links)
- Termination of Single-Path Polynomial Loop Programs (Q3179389) (← links)
- Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants (Q4913868) (← links)
- O-Minimal Invariants for Discrete-Time Dynamical Systems (Q5002799) (← links)
- (Q5089280) (← links)
- Computer Aided Verification (Q5312946) (← links)
- Deciding conditional termination (Q5891476) (← links)