Pages that link to "Item:Q5756499"
From MaRDI portal
The following pages link to Static Analysis by Policy Iteration on Relational Domains (Q5756499):
Displayed 20 items.
- Mathematical programming: Turing completeness and applications to software analysis (Q405669) (← links)
- Abstract interpretation meets convex optimization (Q435969) (← links)
- Tropical linear-fractional programming and parametric mean payoff games (Q435971) (← links)
- Acceleration of the abstract fixpoint computation in numerical program analysis (Q435974) (← links)
- Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case (Q888469) (← links)
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses (Q988565) (← links)
- Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs (Q2260413) (← links)
- Template polyhedra and bilinear optimization (Q2322312) (← links)
- A sums-of-squares extension of policy iterations (Q2406948) (← links)
- Policy iteration in finite templates domain (Q2520672) (← links)
- Static Analysis by Abstract Interpretation: A Mathematical Programming Approach (Q2814107) (← links)
- (Q2861570) (← links)
- Template-Based Unbounded Time Verification of Affine Hybrid Automata (Q2901366) (← links)
- Generalizing the Template Polyhedral Domain (Q3000579) (← links)
- Improving Strategies via SMT Solving (Q3000582) (← links)
- A Policy Iteration Technique for Time Elapse over Template Polyhedra (Q3523151) (← links)
- Stratified Static Analysis Based on Variable Dependencies (Q5170182) (← links)
- Validating numerical semidefinite programming solvers for polynomial invariants (Q5916266) (← links)
- A zonotopic framework for functional abstractions (Q5962973) (← links)
- Decoupling the ascending and descending phases in abstract interpretation (Q6176563) (← links)