@article {Zennou2020360,
	title = {Boosting Sequential Consistency Checking Using Saturation},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {12302 LNCS},
	year = {2020},
	note = {cited By 1},
	pages = {360-376},
	abstract = {We address the problem of checking that an execution of a shared memory concurrent program is sequentially consistent (SC). This problem is NP-hard due to the necessity of finding a total order between the write operations that induces an acyclic happen-before relation. We propose an approach allowing to avoid falling systematically in the worst case, and to check SCness in polynomial-time in most cases in practice. The approach is based on a simple yet powerful saturation-based procedure for computing write constraints that must hold for SCness, allowing on one hand fast detection of SC violations, and on the other hand reducing drastically the search space for a total order witnessing SCness. {\textcopyright} 2020, Springer Nature Switzerland AG.},
	keywords = {Concurrent program, Fast detections, NP-hard, Polynomial approximation, Polynomial-time, Search spaces, Sequential consistency, Shared memory, Total order, Write operations},
	doi = {10.1007/978-3-030-59152-6_20},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85093860805\&doi=10.1007\%2f978-3-030-59152-6_20\&partnerID=40\&md5=a60ea8b0396b220e92dc8ef992c37f30},
	author = {Zennou, R. and Atig, M.F. and Biswas, R. and Bouajjani, A. and Enea, C. and Erradi, M.}
}
