Verifying synchronization coverage in logic code

Abstract

A computer implemented system and method for measuring synchronization coverage for one or more concurrently executed threads is provided. The method comprises updating an identifier of a first thread to comprise an operation identifier associated with a first operation, in response to determining that the first thread has performed the first operation; associating the identifier of the first thread with one or more resources accessed by the first thread; and generating a synchronization coverage model by generating a relational data structure of said one or more resources, wherein a resource is associated with at least the identifier of the first thread and an identifier of a second thread identifier, such that the second thread waits for the first thread before accessing said resource.

What is claimed is: 
     
         1 . A computer implemented method for measuring synchronization coverage for one or more concurrently executed threads, the method comprising:
 updating an identifier of a first thread to comprise an operation identifier associated with a first operation, in response to determining that the first thread has performed the first operation;   associating the identifier of the first thread with one or more resources accessed by the first thread; and   generating a synchronization coverage model by generating a relational data structure of said one or more resources, wherein a resource is associated with at least the identifier of the first thread and an identifier of a second thread identifier, such that the second thread waits for the first thread before accessing said resource.   
     
     
         2 . The method of  claim 1  wherein the first operation comprises accessing the first resource. 
     
     
         3 . The method of  claim 1  wherein the first operation comprises accessing the first resource to read data from the first resource. 
     
     
         4 . The method of  claim 1  wherein the first operation comprises accessing the first resource to write data to the resource. 
     
     
         5 . The method of  claim 1  wherein the first operation comprises entry to a function. 
     
     
         6 . The method of  claim 1  wherein the first operation comprises exit from a function. 
     
     
         7 . The method of  claim 1  wherein the resource is associated with a function performed by the first thread. 
     
     
         8 . The method of  claim 1  wherein the identifier of the first thread comprises N units, wherein each unit comprises an identifier associated with an operation performed by the first thread, wherein each time the identifier of the first thread is updated, the length of the identifier of the first thread is incremented by one unit. 
     
     
         9 . The method of  claim 8 , wherein if the current number of units exceeds X, the oldest unit is removed, wherein X>N. 
     
     
         10 . The method of  claim 9  wherein N is a number utilized to adjust level of detail with which history of operations performed by the first thread is compiled. 
     
     
         11 . The method of  claim 1  wherein the operation identifier indicates that a resource was accessed. 
     
     
         12 . The method of  claim 1  wherein the operation identifier indicates the type of operation performed on a resource. 
     
     
         13 . The method of  claim 1  wherein the operation identifier indicates the resource on which the operation was performed. 
     
     
         14 . The method of  claim 1  wherein the operation identifier indicates the resource and the type of operation performed on the resource.