While developing "bug-free" software is impossible in general, with recent advances in static analysis techniques it is feasible verify certain classes of security properties for large software systems, thus greatly enhancing end users' confidence on the software. In this paper we identify an important class of security properties that can be reduced to the classical dominance problem and show how they can be checked efficiently and accurately, using a dominance algorithm implemented on top of the JaBA analysis framework.
By: Xiaolan Zhang, Trent Jaeger, Larry Koved
Published in: RC23246 in 2004
LIMITED DISTRIBUTION NOTICE:
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 reports@us.ibm.com .