Mohamed Faouzi Atig
Professor at Department of Information Technology; Division of Computer Systems
- Telephone:
- +46 18 471 31 59
- E-mail:
- mohamed_faouzi.atig@it.uu.se
- Visiting address:
- Hus 10, Regementsvägen 10
- Postal address:
- Box 337
751 05 UPPSALA
- CV:
- Download CV
- ORCID:
- 0000-0001-8229-3481
Short presentation
I am a professor in computer systems at the Department of Information Technology, Uppsala University. My research interests broadly span model checking, verification of infinite-state systems, weak memory models, and automata theory.
Biography
Since July 2021, I have been a professor in computer systems at the Department of Information Technology, Uppsala University. From June 2018 to June 2021, I was a senior lecturer (i.e., associate professor) at the Department of Information Technology, Uppsala University. From June 2014 to May 2018, I was an associate senior lecturer (i.e., assistant professor) at the Department of Information Technology, Uppsala University. I also had a researcher position at the Department of Information Technology, Uppsala University from March 2012 to May 2018. Previously, I was a Post-doctoral researcher at Uppsala University from July 2010 to March 2012.
In March 2017, I obtained my docent degree (comparable to habilitation) from Uppsala University. In June 2010, I obtained my doctoral degree in Computer Science from the University of Paris Diderot- Paris 7 (France) under the supervision of Ahmed Bouajjani and Tayssir Touili. I obtained my master in engineering from the Tunisian Polytechnic School (Tunisia) in June 2005 and my Master of Science in Computer Science from the University of Paris Diderot- Paris 7 (France) in September 2006.
My research interests broadly span model checking, verification of infinite state systems, weak memory models, and automata theory.

Publications
Recent publications
-
Checking Consistency of Event-Driven Traces
Part of Programming Languages and Systems, p. 173-194, 2026
- DOI for Checking Consistency of Event-Driven Traces
- Download full text (pdf) of Checking Consistency of Event-Driven Traces
-
Parametrised Verification of Intel-x86 Programs
Part of Proceedings of the ACM on Programming Languages, p. 1094-1122, 2026
- DOI for Parametrised Verification of Intel-x86 Programs
- Download full text (pdf) of Parametrised Verification of Intel-x86 Programs
-
When GNNs Met a Word Equations Solver: Learning to Rank Equations
Part of Frontiers of Combining Systems (FroCoS 2025), p. 327-345, 2025
-
Verification of the Release-Acquire Semantics
Part of Theoretical Aspects of Computing - ICTAC 2025 - 22nd International Colloquium, Marrakech, Morocco, November 24-28, 2025, Proceedings, p. 106-123, 2025
-
Guiding Word Equation Solving using Graph Neural Networks
Part of Automated Technology for Verification and Analysi, p. 279-301, 2024
All publications
Articles in journal
-
Parametrised Verification of Intel-x86 Programs
Part of Proceedings of the ACM on Programming Languages, p. 1094-1122, 2026
- DOI for Parametrised Verification of Intel-x86 Programs
- Download full text (pdf) of Parametrised Verification of Intel-x86 Programs
-
Verification under Intel-x86 with Persistency
Part of Proceedings of the ACM on Programming Languages, 2024
- DOI for Verification under Intel-x86 with Persistency
- Download full text (pdf) of Verification under Intel-x86 with Persistency
-
Part of Computing, p. 2157-2157, 2022
-
Deciding Reachability under Persistent x86-TSO
Part of Proceedings of the ACM on Programming Languages, 2021
- DOI for Deciding Reachability under Persistent x86-TSO
- Download full text (pdf) of Deciding Reachability under Persistent x86-TSO
-
What is decidable under the TSO memory model?
Part of ACM SIGLOG News, p. 4-19, 2020
-
Preface to the VECoS 2018 special issue of ISSE
Part of Innovations in Systems and Software Engineering, p. 99-100, 2020
-
Parameterized verification under TSO is PSPACE-complete
Part of Proceedings of the ACM on Programming Languages, 2020
- DOI for Parameterized verification under TSO is PSPACE-complete
- Download full text (pdf) of Parameterized verification under TSO is PSPACE-complete
-
Optimal stateless model checking for reads-from equivalence under sequential consistency
Part of Proceedings of the ACM on Programming Languages, p. 1-29, 2019
- DOI for Optimal stateless model checking for reads-from equivalence under sequential consistency
- Download full text (pdf) of Optimal stateless model checking for reads-from equivalence under sequential consistency
-
Optimal Stateless Model Checking under the Release-Acquire Semantics
Part of Proceedings of the ACM on Programming Languages, p. 1-29, 2018
- DOI for Optimal Stateless Model Checking under the Release-Acquire Semantics
- Download full text (pdf) of Optimal Stateless Model Checking under the Release-Acquire Semantics
-
A load-buffer semantics for total store ordering
Part of Logical Methods in Computer Science, 2018
-
Mending fences with self-invalidation and self-downgrade
Part of Logical Methods in Computer Science, 2018
-
Flatten and Conquer: A Framework for Efficient Analysis of String Constraints
Part of SIGPLAN notices, p. 602-617, 2017
-
Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete
Part of International Journal of Foundations of Computer Science, p. 945-975, 2017
-
Stateless model checking for TSO and PSO
Part of Acta Informatica, p. 789-818, 2017
-
Adjacent Ordered Multi-Pushdown Systems
Part of International Journal of Foundations of Computer Science, p. 1083-1096, 2014
-
Budget-bounded model-checking pushdown systems
Part of Formal methods in system design, p. 273-301, 2014
-
Model-Checking of Ordered Multi-Pushdown Automata
Part of Logical Methods in Computer Science, p. 20, 2012
-
Context-bounded analysis for concurrent programs with dynamic creation of threads
Part of Logical Methods in Computer Science, 2011
-
On Yen's path logic for Petri nets
Part of International Journal of Foundations of Computer Science, p. 783-799, 2011
-
Verifying parallel programs with dynamic communication structures
Part of Theoretical Computer Science, p. 3460-3468, 2010
Chapters in book
-
Fairness and Liveness Under Weak Consistency
Part of Taming the Infinities of Concurrency, p. 1-21, Springer, 2024
-
Trading Space for Simplicity in Stateless Model Checking
Part of Real Time and Such, p. 79-97, Springer, 2024
-
Consistency and Persistency in Program Verification: Challenges and Opportunities
Part of Principles of Systems Design, p. 494-510, Springer, 2022
Conference papers
-
Checking Consistency of Event-Driven Traces
Part of Programming Languages and Systems, p. 173-194, 2026
- DOI for Checking Consistency of Event-Driven Traces
- Download full text (pdf) of Checking Consistency of Event-Driven Traces
-
When GNNs Met a Word Equations Solver: Learning to Rank Equations
Part of Frontiers of Combining Systems (FroCoS 2025), p. 327-345, 2025
-
Verification of the Release-Acquire Semantics
Part of Theoretical Aspects of Computing - ICTAC 2025 - 22nd International Colloquium, Marrakech, Morocco, November 24-28, 2025, Proceedings, p. 106-123, 2025
-
Guiding Word Equation Solving using Graph Neural Networks
Part of Automated Technology for Verification and Analysi, p. 279-301, 2024
-
Parsimonious Optimal Dynamic Partial Order Reduction
2024
-
Parsimonious Optimal Dynamic Partial Order Reduction
Part of COMPUTER AIDED VERIFICATION, PT II, CAV 2024, p. 19-43, 2024
- DOI for Parsimonious Optimal Dynamic Partial Order Reduction
- Download full text (pdf) of Parsimonious Optimal Dynamic Partial Order Reduction
-
Verification under TSO with an infinite Data Domain
Part of Tools and Algorithms for the Construction and Analysis of Systems, p. 276-295, 2024
- DOI for Verification under TSO with an infinite Data Domain
- Download full text (pdf) of Verification under TSO with an infinite Data Domain
-
Tailoring Stateless Model Checking for Event-Driven Multi-threaded Programs
Part of Automated Technology for Verification and Analysis, p. 176-198, 2023
- DOI for Tailoring Stateless Model Checking for Event-Driven Multi-threaded Programs
- Download full text (pdf) of Tailoring Stateless Model Checking for Event-Driven Multi-threaded Programs
-
Part of Computer Aided Verification - 35th International Conference, {CAV} 2023, Paris, France, July 17-22, 2023, Proceedings, Part {I}}, p. 184-205, 2023
-
Parameterized Verification under TSO with Data Types
Part of Tools and Algorithms for the Construction and Analysis of Systems, p. 588-606, 2023
- DOI for Parameterized Verification under TSO with Data Types
- Download full text (pdf) of Parameterized Verification under TSO with Data Types
-
Optimal Stateless Model Checking for Causal Consistency
Part of Tools and Algorithms for the Construction and Analysis of Systems, p. 105-125, 2023
- DOI for Optimal Stateless Model Checking for Causal Consistency
- Download full text (pdf) of Optimal Stateless Model Checking for Causal Consistency
-
Probabilistic Total Store Ordering
Part of Programming Languages And Systems, ESOP 2022, p. 317-345, 2022
- DOI for Probabilistic Total Store Ordering
- Download full text (pdf) of Probabilistic Total Store Ordering
-
Verifying Reachability for TSO Programs with Dynamic Thread Creation
Part of Networked Systems, NETYS 2022, p. 283-300, 2022
-
On the State Reachability Problem for Concurrent Programs Under Power
Part of Networked Systems - 8th International Conference, {NETYS} 2020, Morocco, Revised Selected Papers, p. 47-59, 2021
-
The Decidability of Verification under PS 2.0
Part of Programming Languages And Systems, ESOP 2021, p. 1-29, 2021
- DOI for The Decidability of Verification under PS 2.0
- Download full text (pdf) of The Decidability of Verification under PS 2.0
-
Solving Not-Substring Constraint with Flat Abstraction
Part of Programming Languages And Systems, APLAS 2021, p. 305-320, 2021
-
On the Separability Problem of String Constraints
Part of 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference), 2020
-
On the Formalization of Decentralized Contact Tracing Protocols
Part of Proceedings of the 2nd Workshop on Artificial Intelligence and Formal Verification, Logic, Automata, and Synthesis hosted by the Bolzano Summer of Knowledge 2020 {(BOSK} 2020), September 25, 2020, p. 65-70, 2020
-
Boosting Sequential Consistency Checking Using Saturation
Part of Automated Technology for Verification and Analysis - 18th International Symposium, ATVA 2020, Proceedings, p. 360-376, 2020
-
Efficient Handling of String-Number Conversion
Part of PLDI 2020, p. 943-957, 2020
-
Part of Automated Technology for Verification and Analysis, p. 277-293, 2019
-
Reachability in database-driven systems with numerical attributes under recency bounding
Part of PODS '19, p. 335-352, 2019
-
Verification of programs under the release-acquire semantics
Part of Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, p. 1117-1132, 2019
-
Dynamic Partial Order Reduction Under the Release-Acquire Semantics (Tutorial)
Part of Networked Systems, p. 3-18, 2019
-
Optimal Stateless Model Checking under the Release-Acquire Semantics
Part of SPLASH OOPSLA 2018, Boston, Nov 4-9, 2018, 2018
-
Replacing store buffers by load buffers in TSO
Part of Verification and Evaluation of Computer and Communication Systems, p. 22-28, 2018
-
Trau: SMT solver for string constraints
Part of Proceedings of the 2018 18th Conference on Formal Methods in Computer Aided Design (FMCAD), 2018
-
Verification of timed asynchronous programs
Part of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018
-
Universal safety for timed Petri nets is PSPACE-complete
Part of 29th International Conference on Concurrency Theory, 2018
-
Verifying quantitative temporal properties of procedural programs
Part of 29th International Conference on Concurrency Theory, 2018
-
Complexity of reachability for data-aware dynamic systems
Part of Proc. 18th International Conference on Application of Concurrency to System Design, p. 11-20, 2018
-
Perfect timed communication is hard
Part of Formal Modeling and Analysis of Timed Systems, p. 91-107, 2018
-
Context-bounded analysis for POWER
Part of Tools and Algorithms for the Construction and Analysis of Systems, p. 56-74, 2017
-
Part of The 28th International Conference on Concurrency Theory, CONCUR 2017, September 5-8, 2017, Berlin, Germany, 2017
-
On the Upward/Downward Closures of Petri Nets∗
Part of 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), 2017
-
Verification of Asynchronous Programs with Nested Locks
Part of 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, December 11-15, 2017, Kanpur, India, 2017
-
Parity Games on Bounded Phase Multi-pushdown Systems
Part of Networked Systems: 5th International Conference, NETYS 2017, Marrakech, Morocco, May 17-19, 2017, Proceedings, p. 272-287, 2017
-
Data Communicating Processes with Unreliable Channels
Part of Proceedings Of The 31St Annual ACM-IEEE Symposium On Logic In Computer Science (LICS 2016), p. 166-175, 2016
-
The benefits of duality in verifying concurrent programs under TSO
Part of 27th International Conference on Concurrency Theory, 2016
-
Recency-Bounded Verification of Dynamic Database-Driven Systems
Part of PODS'16, p. 195-210, 2016
-
Fencing programs with self-invalidation and self-downgrade
Part of Formal Techniques for Distributed Objects, Components, and Systems, p. 19-35, 2016
-
Acceleration in Multi-PushDown Systems
Part of Tools and Algorithms for the Construction and Analysis of Systems, p. 698-714, 2016
-
The complexity of regular abstractions of one-counter languages
Part of Proceedings Of The 31St Annual ACM-IEEE Symposium On Logic In Computer Science (LICS 2016), p. 207-216, 2016
-
Stateless model checking for POWER
Part of Computer Aided Verification, p. 134-156, 2016
-
Counter-Example Guided Program Verification
Part of FM 2016, p. 25-42, 2016
-
The Best of Both Worlds: Trading efficiency and optimality in fence insertion for TSO
Part of Programming Languages and Systems, p. 308-332, 2015
-
Precise and sound automatic fence insertion procedure under PSO
Part of Networked Systems, p. 32-47, 2015
-
Verification of Cache Coherence Protocols wrt. Trace Filters
Part of Proc. 15th Conference on Formal Methods in Computer-Aided Design, p. 9-16, 2015
-
MPass: An efficient tool for the analysis of message-passing programs
Part of Formal Aspects of Component Software, p. 198-206, 2015
-
Stateless model checking for TSO and PSO
Part of Tools and Algorithms for the Construction and Analysis of Systems, p. 353-367, 2015
-
Verification of buffered dynamic register automata
Part of Networked Systems, p. 15-31, 2015
-
What's decidable about availability languages?
Part of Proc. 35th IARCS Conference on Foundation of Software Technology and Theoretical Computer Science, p. 192-205, 2015
-
Norn: An SMT solver for string constraints
Part of Computer Aided Verification, p. 462-469, 2015
-
Activity profiles in online social media
Part of Proc. 6th International Conference on Advances in Social Networks Analysis and Mining, p. 850-855, 2014
-
Verification of Dynamic Register Automata
Part of Leibniz International Proceedings in Informatics, 2014
-
Computing optimal reachability costs in priced dense-timed pushdown automata
Part of Language and Automata Theory and Applications, p. 62-75, 2014
-
Context-Bounded Analysis of TSO Systems
Part of From Programs to Systems, p. 21-38, 2014
-
String Constraints for Verification
Part of Computer Aided Verification - 26th International Conference, {CAV} 2014, Held as Part of the Vienna Summer of Logic, {VSL} 2014, Vienna, Austria, July 18-22, 2014. Proceedings, p. 150-166, 2014
-
Part of Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014, 2014
-
On Bounded Reachability Analysis of Shared Memory Systems
Part of {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2014, December 15-17, 2014, New Delhi, India, 2014
-
Zenoness for Timed Pushdown Automata
Part of Proceedings 15th International Workshop on Verification of Infinite-State Systems, {INFINITY} 2013, Hanoi, Vietnam, 14th October 2013., 2014
-
MEMORAX, a Precise and Sound Tool for Automatic Fence Insertion under TSO
Part of Tools and Algorithms for the Construction and Analysis of Systems, p. 530-536, 2013
- DOI for MEMORAX, a Precise and Sound Tool for Automatic Fence Insertion under TSO
- Download full text (pdf) of MEMORAX, a Precise and Sound Tool for Automatic Fence Insertion under TSO
-
Push-down automata with gap-order constraints
Part of Fundamentals of Software Engineering, p. 199-216, 2013
-
Adjacent ordered multi-pushdown systems
Part of Developments in Language Theory, p. 58-69, 2013
-
Analysis of message passing programs using SMT-solvers
Part of Automated Technology for Verification and Analysis, p. 272-286, 2013
-
Author recognition in discussion boards
Part of National Symposium on Technology and Methodology for Security and Crisis Management, 2013
-
Verification of Directed Acyclic Ad Hoc Networks
Part of Formal Techniques for Distributed Systems, p. 193-208, 2013
- DOI for Verification of Directed Acyclic Ad Hoc Networks
- Download full text (pdf) of Verification of Directed Acyclic Ad Hoc Networks
-
Part of Proc. 27th ACM/IEEE Symposium on Logic in Computer Science, p. 35-44, 2012
-
Counter-Example Guided Fence Insertion under TSO
Part of Tools and Algorithms for the Construction and Analysis of Systems, p. 204-219, 2012
- DOI for Counter-Example Guided Fence Insertion under TSO
- Download full text (pdf) of Counter-Example Guided Fence Insertion under TSO
-
Automatic fence insertion in integer programs via predicate abstraction
Part of Static Analysis, p. 164-180, 2012
-
The minimal cost reachability problem in priced timed pushdown systems
Part of Language and Automata Theory and Applications, p. 58-69, 2012
-
Detecting fair non-termination in multithreaded programs
Part of Computer Aided Verification, p. 210-227, 2012
-
Part of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, p. 374-386, 2012
-
Multi-Pushdown Systems with Budgets
Part of Formal Methods in Computer-Aided Design, p. 24-33, 2012
-
What's decidable about weak memory models?
Part of Programming Languages and Systems, p. 26-46, 2012
-
Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding
Part of Automated Technology for Verification and Analysis, p. 152-166, 2012
-
Adding time to pushdown automata
Part of Quantities in Formal Methods, p. 1-16, 2012
-
Approximating Petri net reachability along context-free traces
Part of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, p. 152-163, 2011
- DOI for Approximating Petri net reachability along context-free traces
- Download full text (pdf) of Approximating Petri net reachability along context-free traces
-
Getting rid of store-buffers in TSO analysis
Part of Computer Aided Verification, p. 99-115, 2011
-
On the verification problem for weak memory models
Part of Proc. 37th ACM Symposium on Principles of Programming Languages, p. 7-18, 2010
-
Global model checking of ordered multi-pushdown systems
Part of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, p. 216-227, 2010
-
From multi to single stack automata
Part of CONCUR 2010 – Concurrency Theory, p. 117-131, 2010