2011 · 94 citations · 7 references
ComputingComputer EngineeringComputer ScienceCompilersTheory Of ComputationData-flow AnalysisNumerical AlgorithmsNumerical AnalysisStatic AnalysisType CheckingComputational PrecisionFinite-precision Arithmetic CircuitsFixed-point ArithmeticFloating-point ArithmeticFloating-point Error Analysis
Abstract. We define several abstract semantics for the static analysis of finite precision computations, that bound not only the ranges of values taken by numerical variables of a program, but also the difference with the result of the same sequence of operations in an idealized real number semantics. These domains point out with more or less detail (control point, block, function for instance) sources of numerical errors in the program and the way they were propagated by further computations, thus allowing to evaluate not only the rounding error, but also sensitivity to inputs or parameters of the program. We describe two classes of abstractions, a non relational one based on intervals, and a weakly relational one based on parametrized zonotopic abstract domains called affine sets, especially well suited for sensitivity analysis and test generation. These abstract domains are implemented in the Fluctuat static analyzer, and we finally present some experiments. 1
7
Static determination of dynamic properties of programs
Patrick Cousot, Radhia Cousot · 1976 · 473 citations
A.: Heap reference analysis using access graphs
2007 · 124 citations