Pages that link to "Item:Q4930733"
From MaRDI portal
The following pages link to Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely (Q4930733):
Displaying 8 items.
- Abstract interpretation meets convex optimization (Q435969) (← links)
- Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case (Q888469) (← links)
- Numerical invariants through convex relaxation and max-strategy iteration (Q2248100) (← links)
- Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs (Q2260413) (← links)
- Template-Based Unbounded Time Verification of Affine Hybrid Automata (Q2901366) (← links)
- Improving Strategies via SMT Solving (Q3000582) (← links)
- Proving Termination by Policy Iteration (Q5170173) (← links)
- Validating numerical semidefinite programming solvers for polynomial invariants (Q5916266) (← links)
