Arithmetic Reasoning for Static Analysis of Software

Software and hardware verification has shown the ability to prove the correctness of many sophisticated algorithms and to discover many subtle errors. But the verification tools are not in every-day use by non-specialists. This paper describes several of the verification methods in a tool, which is in every-day use by programmers. The paper concentrates on theorem proving and related aspects.

By: Daniel Brand, Florian Krohm

Published in: RC22905 in 2003


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .