Precise Fixpoint Computation Through Strategy Iteration
From MaRDI portal
Publication:5756502
DOI10.1007/978-3-540-71316-6_21zbMath1187.68152MaRDI 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
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
Counterexample Guided Path Reduction for Static Program Analysis, Abstract interpretation meets convex optimization, Derivation tree analysis for accelerated fixed-point computation, A minimalistic look at widening operators, Template-Based Unbounded Time Verification of Affine Hybrid Automata, Generalizing the Template Polyhedral Domain, Improving Strategies via SMT Solving, Computing Game Values for Crash Games, Derivation Tree Analysis for Accelerated Fixed-Point Computation, Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains, Polynomial Precise Interval Analysis Revisited