( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Verification of programs under the release-acquire semantics.

, , , и . PLDI, стр. 1117-1132. ACM, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Faouzi Najia

Faouzi Koudsi

Abolghassem Atighetchi

Gholam-Ali Atighetchi

Faouzi Bouachir

 

Другие публикации лиц с тем же именем

The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for TSO., , и . ESOP, том 9032 из Lecture Notes in Computer Science, стр. 308-332. Springer, (2015)Acceleration in Multi-PushDown Systems., , и . TACAS, том 9636 из Lecture Notes in Computer Science, стр. 698-714. Springer, (2016)From Multi to Single Stack Automata.. CONCUR, том 6269 из Lecture Notes in Computer Science, стр. 117-131. Springer, (2010)Verifying Reachability for TSO Programs with Dynamic Thread Creation., , , , и . NETYS, том 13464 из Lecture Notes in Computer Science, стр. 283-300. Springer, (2022)Chain-Free String Constraints., , , , и . ATVA, том 11781 из Lecture Notes in Computer Science, стр. 277-293. Springer, (2019)The Decidability of Verification under PS 2.0., , , , и . ESOP, том 12648 из Lecture Notes in Computer Science, стр. 1-29. Springer, (2021)Adjacent Ordered Multi-Pushdown Systems., , и . Int. J. Found. Comput. Sci., 25 (8): 1083-1096 (2014)On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems., и . RP, том 5797 из Lecture Notes in Computer Science, стр. 1-2. Springer, (2009)What's Decidable about Weak Memory Models?, , , и . ESOP, том 7211 из Lecture Notes in Computer Science, стр. 26-46. Springer, (2012)Verification under TSO with an infinite Data Domain., , , и . TACAS (3), том 14572 из Lecture Notes in Computer Science, стр. 276-295. Springer, (2024)