LOGIN | REGISTER NOW | SUBSCRIBE
 
print Printable version 
Most Read Latest News Blog Resources
Mono brings .NET to Android
At Microsoft MIX, Mono will unveil the ability to port .NET applications to the Android op...

Does Windows cost Microsoft opportunities?
Microsoft's decision to focus .NET on Windows is stifling innovation due to the specter of...

OSBC focus turns to best practices for open-source adoption
Businesses are no longer asking why they should adopt, but how do they use open source leg...

Digg!  Digg
Reddit  Reddit
Slashdot  Slashdot
Share on facebook  Facebook
Share on Twitter  Twitter

Coverity Uncovers Concurrency Errors


By Jennifer deJong
February 1, 2006 — 
San Francisco-based Coverity has updated its source code analyzer, enabling it to detect errors associated with concurrent programming.

Prevent 3.2, which the San Francisco-based company announced late last year, finds errors such as double locks, missing locks and incorrect lock ordering in C/C++ source code, said Coverity product manager Andy Yang. “They are not everyday types of bugs. But when they happen, they are hard to track down.”

Locks and unlocks are used to manage shared functions, variables and resources in applications that execute multiple threads concurrently. Applying locks and unlocks effectively in complex applications is difficult and requires a high degree of developer skill, said Yang. Errors are typically the result of incorrect use, he said. Prevent addresses such errors by tracking, for example, how a piece of memory is locked by function. It can follow complex paths through the code to find errors such as a missing unlock, or a lock that has been applied twice, or in the wrong order, said Yang. The tool identifies and provides information about errors, and recommends fixes.

Also new to 3.2 is integration with the Eclipse framework, IBM Rational Software Development Platform and Wind River Workbench IDE, as well as more detailed reports, which can compare, for example, defect rates across multiple builds and releases, said Yang.

A key reason why concurrent programming errors are hard to detect is that they are difficult to reproduce in the testing process. They typically don’t manifest themselves until the application is deployed, said Yang. By scanning source code, Prevent can help detect such errors early in the development process. “But we are not saying we can find all concurrency problems. That is impossible,” he said.

Coverity competitor Fortify, in Palo Alto, Calif., also can pinpoint problems associated with concurrent programming, including double locks and race conditions, which can occur when threads of operation contend for the same resources, said Fortify CTO Roger Thornton. Source code analysis is not the only way to find concurrent errors. For instance, testing tools such as Compuware’s DevPartner Studio can detect how parts of an application are locking different resources, said Ken Cowan, a product line manager for the Detroit-based company.


Share this link: http://www.sdtimes.com/link/29121
 

Add comment


Name*
Email*  
Country     


  • Comment
  • Preview
Loading



 
 
 
 
News on Monday
more>>
SharePoint Tech Report
more>>


   

 
 
Download Current Issue
ISSUE 3/15/2010 PDF

Need Back Issues?
DOWNLOAD HERE

Receive the print Edition?


 
blogs tab
Google Code turns 5
Google Code Turns 5, and adds a Paxos Algorithm to make the system more stable and reliable.
03/17/2010 11:16 AM EST

Test your Visual Studio 2010 know-how
Microsoft is offering free beta certification exams for Visual Studio 2010.
03/17/2010 11:08 AM EST

Microsoft lifts the hood on IE9
Microsoft is previewing IE9.
03/16/2010 01:10 PM EST

 

Events calendar tab
EclipseCon
3/22/2010 to 3/25/2010
Santa Clara, Calif.
The Eclipse Foundation

DevConnections
4/12/2010 to 4/14/2010
Las Vegas
Penton Media

MySQL Conf. and Expo
4/12/2010 to 4/15/2010
Santa Clara, Calif.
O'Reilly Media

High Performance Computing Linux Financial Markets
4/19/2010
New York City
Flagg Management

Informix User Conf.
4/25/2010 to 4/28/2010
Overland Park, Kans.
IIUG