We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Constant-coefficient multipliers are fundamental components in digital signal processing and arithmetic-based systems. Their verification, however, remains difficult and time-cons...
Abstract. In this paper we argue that using verification in interactive systems development is more than just checking whether the specification of the system has all the required ...
Abstract. We propose a theory of time-bounded verification for realtime systems, in which verification queries are phrased over time intervals of fixed, bounded duration. We argue ...
Library of Numerical Abstract Domains for Static Analysis Bertrand Jeannet1 and Antoine Min?e2 1 INRIA Rh^one-Alpes, Grenoble, France, Bertrand.Jeannet@inrialpes.fr 2 CNRS, ?Ecole ...