Pages that link to "Item:Q5756502"
From MaRDI portal
The following pages link to Precise Fixpoint Computation Through Strategy Iteration (Q5756502):
Displayed 25 items.
- Mathematical programming: Turing completeness and applications to software analysis (Q405669) (← links)
- Abstract interpretation meets convex optimization (Q435969) (← links)
- Complexity of fuzzy answer set programming under Łukasiewicz semantics (Q465597) (← links)
- Derivation tree analysis for accelerated fixed-point computation (Q549189) (← links)
- A minimalistic look at widening operators (Q848744) (← links)
- Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case (Q888469) (← links)
- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence (Q1620957) (← 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 polyhedra and bilinear optimization (Q2322312) (← links)
- A sums-of-squares extension of policy iterations (Q2406948) (← 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)
- Computing Game Values for Crash Games (Q3510795) (← links)
- Derivation Tree Analysis for Accelerated Fixed-Point Computation (Q3533020) (← links)
- Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains (Q3617746) (← links)
- Polynomial Precise Interval Analysis Revisited (Q3644736) (← links)
- Proving Termination by Policy Iteration (Q5170173) (← links)
- Stratified Static Analysis Based on Variable Dependencies (Q5170182) (← links)
- Counterexample Guided Path Reduction for Static Program Analysis (Q5187836) (← links)
- Validating numerical semidefinite programming solvers for polynomial invariants (Q5916266) (← links)
- Decoupling the ascending and descending phases in abstract interpretation (Q6176563) (← links)