This report describes the 2017 Competition on Software Verification (SV-COMP), the 6^ th
edition of the annual thorough comparative evaluation of fully-automatic software verifiers …

This report describes the 2019 Competition on Software Verification (SV-COMP), the 8^ th
edition of a series of comparative evaluations of fully automatic software verifiers for C …

Verification of programs continues to be a challenge and no single known technique
succeeds on all programs. In this paper we present VeriAbs, a reachability verifier for C …

Cryptographic primitives are ubiquitous for modern security. The correctness of their
implementations is crucial to resist malicious attacks. Typical arithmetic computation of these …

Most verification tools find it difficult to prove properties of programs containing loops that
process arrays of large or unknown size. These methods either fail to abstract the array at …

In this paper, we extend our previously described fully automated program verification
system called VIAP primarily for verifying the safety properties of programs with integer …

When applying abstract interpretation to verification, it may suffer from the problem of getting
too conservative over-approximations to verify a given target property, and being hardly able …

We investigate a modification of the classical Bounded Model Checking (BMC) procedure
that does not handle loops through unrolling but via modifications to the control flow graph …

We describe a new SMT bit-blasting API for floating-point (FP) programs and evaluate it
using different off-the-shelf SMT solvers during the verification of several C programs. The …

Efficient automatic verification of real world embedded software with numerous properties is
a challenge. Existing techniques verify a sufficient subset of properties by identifying …