Fast and Generalized Polynomial Time Memory Consistency Verification

Amitabha Roy, Stephan Zeisset, Charles J. Fleckenstein +1

The problem of verifying multi-threaded execution against the memory consistency model of a processor is known to be an NP hard problem. However polynomial time algorithms exist th…