Precise Fixpoint Computation Through Strategy Iteration

DOI10.1007/978-3-540-71316-6_21MaRDI QIDQ5756502zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Precise Relational Invariants Through Strategy Iteration
• Polynomial Precise Interval Analysis Revisited
• COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS
• Computer Aided Verification
• Least solutions of equations over N

Cited in

(31)

• Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
• Counterexample guided path reduction for static program analysis
• A sums-of-squares extension of policy iterations
• Mathematical programming: Turing completeness and applications to software analysis
• Real equation systems with alternating fixed-points
• Computing Game Values for Crash Games
• Derivation tree analysis for accelerated fixed-point computation
• A minimalistic look at widening operators
• Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
• Numerical invariants through convex relaxation and max-strategy iteration
• Proving termination by policy iteration
• Template-based unbounded time verification of affine hybrid automata
• Stratified static analysis based on variable dependencies
• Abstract interpretation meets convex optimization
• Template polyhedra and bilinear optimization
• Decoupling the ascending and descending phases in abstract interpretation
• A linear algorithm to solve fixed-point equations on transition systems
• Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs
• scientific article; zbMATH DE number 67117 (Why is no real title available?)
• Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case
• Derivation Tree Analysis for Accelerated Fixed-Point Computation
• An even faster solver for general systems of equations
• Static analysis by abstract interpretation: a mathematical programming approach
• Mathematical programming based debugging
• Complexity of fuzzy answer set programming under Łukasiewicz semantics
• Polynomial Precise Interval Analysis Revisited
• Validating numerical semidefinite programming solvers for polynomial invariants
• Improving strategies via SMT solving
• A change-based heuristic for static analysis with policy iteration
• Generalizing the template polyhedral domain
• Precise Relational Invariants Through Strategy Iteration

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756502)