Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Mohamed Faouzi Atig
2010 – today
- 2013
[c27]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jonathan Cederberg: Analysis of Message Passing Programs Using SMT-Solvers. ATVA 2013: 272-286
[c26]Mohamed Faouzi Atig, K. Narayan Kumar, Prakash Saivasan: Adjacent Ordered Multi-Pushdown Systems. Developments in Language Theory 2013: 58-69
[c25]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Othmane Rezine: Verification of Directed Acyclic Ad Hoc Networks. FMOODS/FORTE 2013: 193-208
[c24]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Giorgio Delzanno, Andreas Podelski: Push-Down Automata with Gap-Order Constraints. FSEN 2013: 199-216
[c23]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Carl Leonardsson, Ahmed Rezine: Memorax, a Precise and Sound Tool for Automatic Fence Insertion under TSO. TACAS 2013: 530-536- 2012
[j4]Mohamed Faouzi Atig: Model-Checking of Ordered Multi-Pushdown Automata. Logical Methods in Computer Science 8(3) (2012)
[c22]Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan: Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding. ATVA 2012: 152-166
[c21]Mohamed Faouzi Atig, Ahmed Bouajjani, Michael Emmi, Akash Lal: Detecting Fair Non-termination in Multithreaded Programs. CAV 2012: 210-226
[c20]Mohamed Faouzi Atig, Ahmed Bouajjani, Sebastian Burckhardt, Madanlal Musuvathi: What's Decidable about Weak Memory Models? ESOP 2012: 26-46
[c19]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Othmane Rezine, Jari Stenman: Multi-pushdown systems with budgets. FMCAD 2012: 24-33
[c18]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jonathan Cederberg: Timed Lossy Channel Systems. FSTTCS 2012: 374-386
[c17]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman: The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems. LATA 2012: 58-69
[c16]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman: Dense-Timed Pushdown Automata. LICS 2012: 35-44
[c15]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Carl Leonardsson, Ahmed Rezine: Automatic Fence Insertion in Integer Programs via Predicate Abstraction. SAS 2012: 164-180
[c14]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Carl Leonardsson, Ahmed Rezine: Counter-Example Guided Fence Insertion under TSO. TACAS 2012: 204-219
[c13]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman: Adding Time to Pushdown Automata. QFM 2012: 1-16
[e1]Mohamed Faouzi Atig, Ahmed Rezine (Eds.): Proceedings 14th International Workshop on Verification of Infinite-State Systems. EPTCS 107, 2012
[i2]Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan: Model checking Branching-Time Properties of Multi-Pushdown Systems is Hard. CoRR abs/1205.6928 (2012)- 2011
[j3]Mohamed Faouzi Atig, Ahmed Bouajjani, Shaz Qadeer: Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads. Logical Methods in Computer Science 7(4) (2011)
[j2]Mohamed Faouzi Atig, Peter Habermehl: On Yen's Path Logic for Petri Nets. Int. J. Found. Comput. Sci. 22(4): 783-799 (2011)
[c12]Mohamed Faouzi Atig, Ahmed Bouajjani, Gennaro Parlato: Getting Rid of Store-Buffers in TSO Analysis. CAV 2011: 99-115
[c11]Mohamed Faouzi Atig, Pierre Ganty: Approximating Petri Net Reachability Along Context-free Traces. FSTTCS 2011: 152-163
[i1]Pierre Ganty, Mohamed Faouzi Atig: Approximating Petri Net Reachability Along Context-free Traces. CoRR abs/1105.1657 (2011)- 2010
[j1]Tayssir Touili, Mohamed Faouzi Atig: Verifying parallel programs with dynamic communication structures. Theor. Comput. Sci. 411(38-39): 3460-3468 (2010)
[c10]
[c9]
[c8]Mohamed Faouzi Atig, Ahmed Bouajjani, Sebastian Burckhardt, Madanlal Musuvathi: On the verification problem for weak memory models. POPL 2010: 7-18
2000 – 2009
- 2009
[c7]Mohamed Faouzi Atig, Ahmed Bouajjani: On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems. RP 2009: 1-2
[c6]
[c5]Mohamed Faouzi Atig, Ahmed Bouajjani, Shaz Qadeer: Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads. TACAS 2009: 107-123
[c4]Mohamed Faouzi Atig, Tayssir Touili: Verifying Parallel Programs with Dynamic Communication Structures. CIAA 2009: 145-154- 2008
[c3]Mohamed Faouzi Atig, Ahmed Bouajjani, Tayssir Touili: On the Reachability Analysis of Acyclic Networks of Pushdown Systems. CONCUR 2008: 356-371
[c2]Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl: Emptiness of Multi-pushdown Automata Is 2ETIME-Complete. Developments in Language Theory 2008: 121-133
[c1]Mohamed Faouzi Atig, Ahmed Bouajjani, Tayssir Touili: Analyzing Asynchronous Programs with Preemption. FSTTCS 2008: 37-48
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:12 CEST by the dblp team



