Dossier de Mohamed Faouzi Atig

Publications liées à la thèse

Livres ou chapitres de livre

Articles dans des revues internationales avec comité de lecture

  1. M.F. Atig and P. Habermehl. On Yens Path Logic for Petri Nets. The International Journal of Foundations of Computer Science (IJFCS). To appear.
  2. M.F. Atig, A. Bouajjani and S. Qadeer. Context-bounded analysis for concurrent programs with dynamic creation of threads. The Journal of Logical Methods in Computer Science (LMCS). To appear.
  3. T. Touili and M.F. Atig. Verifying parallel programs with dynamic communication structures. Theoretical Computer Science 411(38–39): 3460–3468 (2010).

Articles dans des conférences internationales avec comité de lecture

  1. M.F. Atig. Global Model Checking of Ordered Multi-Pushdown Systems . In Proc. 30th Intern. Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS10), Chennai (India). To appear.
  2. M. F. Atig. From Multi to Single Stack Automata. In Proc. 21th International Conference on Concurrency Theory (CONCUR10), Paris (France). LNCS 6269, pages 117–131. Springer.
  3. M.F. Atig, A. Bouajjani, S. Burckhardt and M. Musuvathi. On the verification problem for weak memory models. In Proc. Principles of Programming Languages (POPL10), Madrid (Spain). ACM, pages 7–18.
  4. M.F. Atig, A. Bouajjani and S. Qadeer. Context-bounded analysis for concurrent programs with dynamic creation of threads. In Proc. 15th Intern. Conf. on Tools and Algorithms for the Construction and Analysis Systems (TACAS09), York (UK). LNCS 5505, pages 107–123. Springer.
  5. M. F. Atig and T. Touili. Verifying Parallel Programs with Dynamic Communication Structures. In Proc. 14th International Conference on Implementation and Application of Automata (CIAA09), Sydney (Australia). LNCS 5642, pages 145–154. Springer.
  6. M.F. Atig, A. Bouajjani and T. Touili. Analyzing asynchronous programs with preemption. In Proc. 28th Intern. Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS08), Bangalore (India). LIPIcs 2, pages 37–48.
  7. M.F. Atig, B. Bollig and P. Habermehl. Emptiness of multipushdown automata is 2ETIME-complete. In Masami Ito (ed.), Proceedings of the 12th International Conference on Developments in Language Theory (DLT08), Kyoto (Japan). LNCS 5257, pages 121–132. Springer.
  8. M. F. Atig, A. Bouajjani and T. Touili. On the Reachability analysis of acyclic networks of pushdown systems. In proc. 19th Intern. Conf. On Concurrency Theory (CONCUR08), Toronto (Canada). LNCS 5201, pages 356–371. Springer.

Articles dans des workshops internationaux avec comité de lecture

  1. M.F. Atig and P. Habermehl. On Yens Path Logic for Petri Nets. In Proc. 3rd Workshop on Reachability Problems (RP09), Paris (France). LNCS 5797, pages 51–63. Springer.

Autres publications

En cas de problème avec ce dossier, contactez le secrétaire du prix Mathieu Giraud