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 …

This paper presents a theory of non-linear integer/real arithmetic and algorithms for
reasoning about this theory. The theory can be conceived of as an extension of linear …

Across the broad research field concerned with the analysis of computational systems,
research endeavors are often categorized by the respective models under investigation …

VeriAbs is a portfolio software verifier for ANSI-C programs. To prove properties with better
efficiency and scalability, this version implements output abstraction with k-induction in the …

Cooperative verification is an approach in which several verifiers help each other solving the
verification problem by sharing artifacts about the verification process. There are many …

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 …

Sound static analyzers over-approximate the input program behaviour and thus imprecisely
report many correct properties as potential errors (false warnings). Manual investigation of …

VeriAbs verifies C programs by transforming them to abstract programs. The transformation
replaces loops in the original code by abstract loops of small known bounds. Bounded …

The application of Model Checking to compute WCET has not been explored as much as
Integer Linear Programming (ILP), primarily because model checkers fail to scale for …

Abstract Bounded Model Checking is one the most successful techniques for finding bugs in
program. However, model checkers are resource hungry and are often unable to verify …