International audienceWe present a new numerical abstract domain. This domain automatically detects and proves bounds on the values of program variables. For that purpose, it relates variable values to a clock counter. More precisely, it bounds these values with the i-th iterate of the function [X |-> aX+b] applied on M, where i denotes the clock counter and the floating-point numbers a, b, and M are discovered by the analysis. Such properties are especially useful to analyze loops in which a variable is iteratively assigned with a barycentric mean of the values that were associated with the same variable at some previous iterations. Because of rounding errors, the computation of this barycenter may diverge when the loop is iterated forever...
AbstractStatic analysis by abstract interpretation aims at automatically proving properties of compu...
this paper is to propose rigorous error analysis of both the intrinsic and rounding errors based on ...
Roundoff errors cannot be avoided when implementing numerical programs with finite precision. The ab...
We present ABC, a software tool for automatically computing symbolic upper bounds on the number of i...
Static analysis by abstract interpretation aims at automatically proving properties of computer prog...
International audienceStatic analysis by abstract interpretation aims at automatically proving prope...
We present a new tool that generates bounds on the values and the round-off errors of programs using...
We present ABC, a software tool for automatically computing symbolic upper bounds on the number of i...
This paper describes a precise numerical abstract domain for use in timing analysis. The numerical a...
In the Cellular Automata (CA) literature, discrete lines inside (discrete) space-time diagrams are o...
AbstractTemporal property verification is utterly important to ensure safety of critical real-time s...
AbstractExact computation is assumed in most algorithms in computational geometry. In practice, impl...
A real number x is constructive if an algorithm can be given to compute arbitrarily accurate approxi...
In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple “core ” programming language— an ...
AbstractStatic analysis by abstract interpretation aims at automatically proving properties of compu...
AbstractStatic analysis by abstract interpretation aims at automatically proving properties of compu...
this paper is to propose rigorous error analysis of both the intrinsic and rounding errors based on ...
Roundoff errors cannot be avoided when implementing numerical programs with finite precision. The ab...
We present ABC, a software tool for automatically computing symbolic upper bounds on the number of i...
Static analysis by abstract interpretation aims at automatically proving properties of computer prog...
International audienceStatic analysis by abstract interpretation aims at automatically proving prope...
We present a new tool that generates bounds on the values and the round-off errors of programs using...
We present ABC, a software tool for automatically computing symbolic upper bounds on the number of i...
This paper describes a precise numerical abstract domain for use in timing analysis. The numerical a...
In the Cellular Automata (CA) literature, discrete lines inside (discrete) space-time diagrams are o...
AbstractTemporal property verification is utterly important to ensure safety of critical real-time s...
AbstractExact computation is assumed in most algorithms in computational geometry. In practice, impl...
A real number x is constructive if an algorithm can be given to compute arbitrarily accurate approxi...
In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple “core ” programming language— an ...
AbstractStatic analysis by abstract interpretation aims at automatically proving properties of compu...
AbstractStatic analysis by abstract interpretation aims at automatically proving properties of compu...
this paper is to propose rigorous error analysis of both the intrinsic and rounding errors based on ...
Roundoff errors cannot be avoided when implementing numerical programs with finite precision. The ab...