Implied Set Closure and Its Application to Memory Consistency Verification

@inproceedings{Baswana2008ImpliedSC,
  title={Implied Set Closure and Its Application to Memory Consistency Verification},
  author={Surender Baswana and Shashank K. Mehta and Vishal Powar},
  booktitle={CAV},
  year={2008}
}
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) memory consistency model. They also devised an algorithm based on this procedure with time complexity O(n), where n is the total number of instructions in the program. Roy et. al. [6] have improved the implementation of the procedure and achieved O(n) time complexity. We have identified the bottleneck in these algorithms… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…