Pages that link to "Item:Q3525073"
From MaRDI portal
The following pages link to Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems (Q3525073):
Displaying 11 items.
- Recent advances in program verification through computer algebra (Q351971) (← links)
- Generating exact nonlinear ranking functions by symbolic-numeric hybrid method (Q394460) (← links)
- On invariant checking (Q394493) (← links)
- Termination of linear programs with nonlinear constraints (Q604395) (← links)
- A new look at the automatic synthesis of linear ranking functions (Q714505) (← links)
- Synthesizing ranking functions for loop programs via SVM (Q2084940) (← links)
- Discovering non-terminating inputs for multi-path polynomial programs (Q2341594) (← links)
- Witness to non-termination of linear programs (Q2357364) (← links)
- Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods (Q2418665) (← links)
- Termination of Single-Path Polynomial Loop Programs (Q3179389) (← links)
- (Q5089280) (← links)