Precise Fixpoint Computation Through Strategy Iteration

DOI10.1007/978-3-540-71316-6_21zbMATH Open1187.68152OpenAlexW1559488388MaRDI QIDQ5756502FDOQ5756502

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

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

Mathematics Subject Classification ID

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

Cited In (29)

• Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
• A sums-of-squares extension of policy iterations
• Mathematical programming: Turing completeness and applications to software analysis
• Improving Strategies via SMT Solving
• 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
• Generalizing the Template Polyhedral Domain
• Abstract interpretation meets convex optimization
• Decoupling the ascending and descending phases in abstract interpretation
• Template polyhedra and bilinear optimization
• 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
• Title not available (Why is that?)
• Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case
• Derivation Tree Analysis for Accelerated Fixed-Point Computation
• Template-Based Unbounded Time Verification of Affine Hybrid Automata
• Static analysis by abstract interpretation: a mathematical programming approach
• Mathematical programming based debugging
• Counterexample Guided Path Reduction for Static Program Analysis
• Complexity of fuzzy answer set programming under Łukasiewicz semantics
• Polynomial Precise Interval Analysis Revisited
• Validating numerical semidefinite programming solvers for polynomial invariants
• Proving Termination by Policy Iteration
• A change-based heuristic for static analysis with policy iteration
• Stratified Static Analysis Based on Variable Dependencies
• 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)