On recent architectures, a numerical program may give different answers depending on the
execution hardware and the compilation. Our goal is to formally prove properties about …

On certain recently developed architectures, a numerical program may give different
answers depending on the execution hardware and the compilation. Our goal is to formally …

On some recently developed architectures, a numerical program may give different answers
depending on the execution hardware and the compilation. These discrepancies of the …

We present an approach to modeling and verifying machine-code programs that exhibit non-
determinism. Specifically, we add support for system calls to our formal, executable model of …

Numerical programs may require a high level of guarantee. This can be achieved by
applying formal methods, such as machine-checked proofs. But these tools handle …

We present an approach for proving behavioral properties of numerical programs by
analyzing their compiled assembly code. We focus on the issues and traps that may arise on …

We propose a proof-producing symbolic execution for verification of machine-level
programs. The analysis is based on a set of core inference rules that are designed to give …

Reasoning about floating-point is difficult and becomes only more so if there is an interplay
between floating-point and bit-level operations. Even though real-world floating-point …

Floating-point arithmetic is known to be tricky: roundings, formats, exceptional values. The
IEEE-754 standard was a push towards straightening the field and made formal reasoning …

We provide concrete evidence that floating-point computations in C programs can be
verified in a homogeneous verification setting based on Coq only, by evaluating the …