Coverity Announces Breakthrough Software Code Analysis EngineWorld's First Use of Satisfiability to Accelerate Software Development Now Available in Coverity PreventSeptember 19, 2007: Coverity announced at Embedded Systems Conference (ESC) in Boston the first software analysis engine based on Boolean satisfiability (SAT). Unlike current static analysis engines that rely on dataflow analysis and multiple checkers to identify software defects, the SAT engine is based on Boolean satisfiability and will enable multiple Solvers to identify software defects. Over 300 customers rely on Coverity Prevent to analyze every path through their applications, and now, by leveraging SAT, Prevent can analyze every value in every computation within these programs. This exhaustive static code analysis enables Coverity to deliver the most accurate identification of critical performance and security vulnerabilities in the industry. "We are committed to helping our customers create the most reliable and secure code in the world," said Ben Chelf, CTO of Coverity. "Bringing SAT’s proven capabilities to static code analysis will provide developers with an arsenal of new Solvers that uncover the toughest code defects. By leveraging technology that automates the accurate detection of defects, developers can stop wasting their valuable time tracking down bugs and can focus on bringing new software applications to market." Available today, Coverity’s False Path Pruning Solver is the first Solver to be released for Prevent. The False Path Pruning Solver significantly lowers the number of false positive results in static code analysis. By leveraging SAT to determine if the path to a potential software defect is feasible, the Solver identifies and excludes unfeasible defects. By pruning these infeasible results, the Solver increases the overall accuracy of code analysis results and allows developers to focus on defects that pose a genuine threat to the success of their projects. After testing on over 2 million lines of code from multiple applications of open source software from Coverity’s Scan project, the False Path Pruning Solver was found to reduce false positive results by an average of 30 percent. Coverity plans to release two additional Solvers in early 2008 that allow customers to check code assertions statically and to detect critical bug categories including integer overflows. In addition, these Solvers will expand Coverity’s existing dataflow analysis capabilities to uncover even greater numbers of buffer overflows while maintaining a low false positive rate. Coverity Prevent is available immediately for C, C++ and Java software projects, and is priced based on project size. This page is based on a press release of Coverity Inc. last updated: 13.01.2009 © 2008-2009 Coverity Inc., San Francisco |