( en | de | ru )

 

Disambiguation of "Atig, Mohamed Faouzi"

Author of the publication

copydeleteadd this publication to your clipboard
What's Decidable about Weak Memory Models?

, , , and . ESOP, volume 7211 of Lecture Notes in Computer Science, page 26-46. Springer, (2012)

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. You can also use the button next to the name to display some publications already assigned to the person.

Faouzi Najia

Faouzi Koudsi

Abolghassem Atighetchi

Gholam-Ali Atighetchi

Faouzi Bouachir

 

Other publications of authors with the same name

From Multi to Single Stack Automata.. CONCUR, volume 6269 of Lecture Notes in Computer Science, page 117-131. Springer, (2010)On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems., and . RP, volume 5797 of Lecture Notes in Computer Science, page 1-2. Springer, (2009)Acceleration in Multi-PushDown Systems., , and . TACAS, volume 9636 of Lecture Notes in Computer Science, page 698-714. Springer, (2016)What's Decidable about Weak Memory Models?, , , and . ESOP, volume 7211 of Lecture Notes in Computer Science, page 26-46. Springer, (2012)Adjacent Ordered Multi-Pushdown Systems., , and . Int. J. Found. Comput. Sci., 25 (8): 1083-1096 (2014)Preface to the VECoS 2018 special issue of ISSE., and . Innov. Syst. Softw. Eng., 16 (2): 99-100 (2020)Zenoness for Timed Pushdown Automata., , and . INFINITY, volume 140 of EPTCS, page 35-47. (2013)Global Model Checking of Ordered Multi-Pushdown Systems.. FSTTCS, volume 8 of LIPIcs, page 216-227. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for TSO., , and . ESOP, volume 9032 of Lecture Notes in Computer Science, page 308-332. Springer, (2015)The Decidability of Verification under Promising 2.0., , , , and . CoRR, (2020)