Accelerated Data-Flow Analysis

DOI10.1007/978-3-540-74061-2_12zbMath1211.68093OpenAlexW1771118579MaRDI QIDQ3612002

Jérôme Leroux, Grégoire Sutre

Publication date: 3 March 2009

Published in: Static Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74061-2_12

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (8)

Acceleration of the abstract fixpoint computation in numerical program analysis ⋮ Convex Hull of Arithmetic Automata ⋮ Improving Strategies via SMT Solving ⋮ Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs ⋮ Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains ⋮ Acceleration in Convex Data-Flow Analysis ⋮ Abstract Fixpoint Computations with Numerical Acceleration Methods ⋮ Polynomial Precise Interval Analysis Revisited

Uses Software

• TREX

This page was built for publication: Accelerated Data-Flow Analysis