Precise Fixpoint Computation Through Strategy Iteration

DOI10.1007/978-3-540-71316-6_21zbMath1187.68152OpenAlexW1559488388MaRDI QIDQ5756502

Thomas Martin Gawlitza, Helmut Seidl

Publication date: 4 September 2007

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71316-6_21

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (25)

Improving the results of program analysis by abstract interpretation beyond the decreasing sequence ⋮ Template-Based Unbounded Time Verification of Affine Hybrid Automata ⋮ A minimalistic look at widening operators ⋮ A sums-of-squares extension of policy iterations ⋮ Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case ⋮ Mathematical programming: Turing completeness and applications to software analysis ⋮ Computing Game Values for Crash Games ⋮ Decoupling the ascending and descending phases in abstract interpretation ⋮ Abstract interpretation meets convex optimization ⋮ Derivation Tree Analysis for Accelerated Fixed-Point Computation ⋮ Complexity of fuzzy answer set programming under Łukasiewicz semantics ⋮ Generalizing the Template Polyhedral Domain ⋮ Improving Strategies via SMT Solving ⋮ Numerical invariants through convex relaxation and max-strategy iteration ⋮ Proving Termination by Policy Iteration ⋮ Stratified Static Analysis Based on Variable Dependencies ⋮ Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs ⋮ Derivation tree analysis for accelerated fixed-point computation ⋮ Unnamed Item ⋮ Counterexample Guided Path Reduction for Static Program Analysis ⋮ Validating numerical semidefinite programming solvers for polynomial invariants ⋮ Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains ⋮ Static Analysis by Abstract Interpretation: A Mathematical Programming Approach ⋮ Polynomial Precise Interval Analysis Revisited ⋮ Template polyhedra and bilinear optimization

This page was built for publication: Precise Fixpoint Computation Through Strategy Iteration