TACAS11: Compositionality Entails Sequentializability

Almost all existing approaches that verify concurrent program restrict the number of contxt switch such that an under-approximation can be obtained.

 

But this paper avoid this by Compositionality, so it can transform the concurrent program into sequential one, which make it possible to be verified by exiting tools.

 

I am not too interest in this topic