( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Acceleration in Multi-PushDown Systems.

, , и . TACAS, том 9636 из Lecture Notes in Computer Science, стр. 698-714. Springer, (2016)

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

 

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

Adjacent Ordered Multi-Pushdown Systems., , и . Int. J. Found. Comput. Sci., 25 (8): 1083-1096 (2014)Preface to the VECoS 2018 special issue of ISSE., и . Innov. Syst. Softw. Eng., 16 (2): 99-100 (2020)Acceleration in Multi-PushDown Systems., , и . TACAS, том 9636 из Lecture Notes in Computer Science, стр. 698-714. Springer, (2016)What's Decidable about Weak Memory Models?, , , и . ESOP, том 7211 из Lecture Notes in Computer Science, стр. 26-46. Springer, (2012)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)On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems., и . RP, том 5797 из Lecture Notes in Computer Science, стр. 1-2. Springer, (2009)Zenoness for Timed Pushdown Automata., , и . INFINITY, том 140 из EPTCS, стр. 35-47. (2013)Global Model Checking of Ordered Multi-Pushdown Systems.. FSTTCS, том 8 из LIPIcs, стр. 216-227. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)From Multi to Single Stack Automata.. CONCUR, том 6269 из Lecture Notes in Computer Science, стр. 117-131. Springer, (2010)The Decidability of Verification under Promising 2.0., , , , и . CoRR, (2020)