Get started
Author

Mohamed Faouzi Atig

Observed names: Atig M. F., Atig, Mohamed Faouzi, Atig, Mohamed, Faouzi, Diep, Mohamed Faouzi Atig Bui Phi, Faouzi Atig, Mohamed, M. F. Atig, MOHAMED FAOUZI ATIG, Mohamad Faouzi Atig
Institution: Uppsala University
Observed institutions: Uppsala University, Centre National de la Recherche Scientifique, Indian Institute of Technology Bombay, Délégation Paris 7, Université Paris Cité, Laboratoire d'Informatique Algorithmique: Fondements et Applications, Université Paris Diderot, Université Pierre-et-Marie-Curie
ORCID: 0000-0001-8229-3481
Observed ORCID: 0000-0001-8229-3481
OpenAlex ID: A5047278328
On the verification problem for weak memory models
2010 · Mohamed Faouzi Atig, Ahmed Bouajjani, et al. · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 153
Stateless Model Checking for TSO and PSO
2015 · Parosh Aziz Abdulla, Stavros Aronis, et al. · Lecture notes in computer science · 119
String Constraints for Verification
2014 · Parosh Aziz Abdulla, Mohamed Faouzi Atig, et al. · Lecture notes in computer science · 103
PDF
Norn: An SMT Solver for String Constraints
2015 · Parosh Aziz Abdulla, Mohamed Faouzi Atig, et al. · Lecture notes in computer science · 92
Optimal stateless model checking under the release-acquire semantics
2018 · Parosh Aziz Abdulla, Mohamed Faouzi Atig, et al. · Proceedings of the ACM on Programming Languages · 79
PDF
Dense-Timed Pushdown Automata
2012 · Parosh Aziz Abdulla, Mohamed Faouzi Atig, et al. · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 69
Optimal stateless model checking for reads-from equivalence under sequential consistency
2019 · Parosh Aziz Abdulla, Mohamed Faouzi Atig, et al. · Proceedings of the ACM on Programming Languages · 67
PDF
Stateless Model Checking for POWER
2016 · Parosh Aziz Abdulla, Mohamed Faouzi Atig, et al. · Lecture notes in computer science · 65
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
2008 · Mohamed Faouzi Atig, Benedikt Bollig, et al. · Lecture notes in computer science · 63
What’s Decidable about Weak Memory Models?
2012 · Mohamed Faouzi Atig, Ahmed Bouajjani, et al. · Lecture notes in computer science · 60
Getting Rid of Store-Buffers in TSO Analysis
2011 · Mohamed Faouzi Atig, Ahmed Bouajjani, et al. · Lecture notes in computer science · 60
Counter-Example Guided Fence Insertion under TSO
2012 · Parosh Aziz Abdulla, Mohamed Faouzi Atig, et al. · Lecture notes in computer science · 58
PDF
Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads
2011 · Mohamed Faouzi Atig, Ahmed Bouajjani, et al. · Logical Methods in Computer Science · 56
PDF
Stateless model checking for TSO and PSO
2016 · Parosh Aziz Abdulla, Stavros Aronis, et al. · Acta Informatica · 52
PDF
Flatten and conquer: a framework for efficient analysis of string constraints
2017 · Parosh Aziz Abdulla, Mohamed Faouzi Atig, et al. · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · 48
Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
2009 · Mohamed Faouzi Atig, Ahmed Bouajjani, et al. · Lecture notes in computer science · 48
On the Reachability Analysis of Acyclic Networks of Pushdown Systems
2008 · Mohamed Faouzi Atig, Ahmed Bouajjani, et al. · Lecture notes in computer science · 48
Trau: SMT solver for string constraints
2018 · Parosh Aziz Abdulla, Mohamed Faouzi Atig, et al. · Formal Methods in Computer-Aided Design · 46
Verification of programs under the release-acquire semantics
2019 · Parosh Aziz Abdulla, Jatin Arora, et al. · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · 43
The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for TSO
2015 · Parosh Aziz Abdulla, Mohamed Faouzi Atig, et al. · Lecture notes in computer science · 39
On the verification problem for weak memory models
2010 · Mohamed Faouzi Atig, Ahmed Bouajjani, et al. · ACM SIGPLAN Notices · 39
Chain-Free String Constraints
2019 · Parosh Aziz Abdulla, Mohamed Faouzi Atig, et al. · Lecture notes in computer science · 36
Approximating Petri Net Reachability Along Context-free Traces
2011 · Atig, Mohamed Faouzi, Ganty, Pierre · arXiv (Cornell University) · 35
PDF
Detecting Fair Non-termination in Multithreaded Programs
2012 · Mohamed Faouzi Atig, Ahmed Bouajjani, et al. · Lecture notes in computer science · 34
On Yen's Path Logic for Petri Nets
2011 · MOHAMED FAOUZI ATIG, PETER HABERMEHL · International Journal of Foundations of Computer Science · 33
Works count: 157
Citation count: 2,319
H-index: 29
I10-index: 60
Year
Topic
Type