Mohamed Faouzi Atig

Mohamed Faouzi Atig

Uppsala Universitet

H-index: 28

Europe-Sweden

About Mohamed Faouzi Atig

Mohamed Faouzi Atig, With an exceptional h-index of 28 and a recent h-index of 17 (since 2020), a distinguished researcher at Uppsala Universitet, specializes in the field of Computer Science.

His recent articles reflect a diverse array of research interests and contributions to the field:

Verification under TSO with an infinite Data Domain

Fairness and Liveness Under Weak Consistency

Overcoming Memory Weakness with Unified Fairness

Optimal Stateless Model Checking for Causal Consistency

Parameterized verification under TSO with data types

Tailoring Stateless Model Checking for Event-Driven Multi-threaded Programs

Overcoming Memory Weakness with Unified Fairness: Systematic Verification of Liveness in Weak Memory Models

The Computing Journal gratefully acknowledges the editorial work of the scientists listed below on the special issue entitled “SI: NETYS 2019”

Mohamed Faouzi Atig Information

University

Position

___

Citations(all)

2472

Citations(since 2020)

1168

Cited By

1863

hIndex(all)

28

hIndex(since 2020)

17

i10Index(all)

53

i10Index(since 2020)

28

Email

University Profile Page

Uppsala Universitet

Google Scholar

View Google Scholar Profile

Mohamed Faouzi Atig Skills & Research Interests

Computer Science

Top articles of Mohamed Faouzi Atig

Title

Journal

Author(s)

Publication Date

Verification under TSO with an infinite Data Domain

Parosh Aziz Abdulla

Mohamed Faouzi Atig

Florian Furbach

Shashwat Garg

2024/4/5

Fairness and Liveness Under Weak Consistency

Parosh Aziz Abdulla

Mohamed Faouzi Atig

Adwait Godbole

Krishna Shankaranarayanan

Mihir Vahanwala

2024/3/20

Overcoming Memory Weakness with Unified Fairness

arXiv preprint arXiv:2305.17605

Parosh Aziz Abdulla

Mohamed Faouzi Atig

Adwait Godbole

Shankaranarayanan Krishna

Mihir Vahanwala

2023/5/28

Optimal Stateless Model Checking for Causal Consistency

Parosh Abdulla

Mohamed Faouzi Atig

S Krishna

Ashutosh Gupta

Omkar Tuppe

2023/4/22

Parameterized verification under TSO with data types

Parosh Aziz Abdulla

Mohamad Faouzi Atig

Florian Furbach

Adwait A Godbole

Yacoub G Hendi

...

2023/4/22

Tailoring Stateless Model Checking for Event-Driven Multi-threaded Programs

Parosh Aziz Abdulla

Mohamed Faouzi Atig

Frederik Meyer Bønneland

Sarbojit Das

Bengt Jonsson

...

2023/10/19

Overcoming Memory Weakness with Unified Fairness: Systematic Verification of Liveness in Weak Memory Models

Parosh Aziz Abdulla

Mohamed Faouzi Atig

Adwait Godbole

Shankaranarayanan Krishna

Mihir Vahanwala

2023/7/17

The Computing Journal gratefully acknowledges the editorial work of the scientists listed below on the special issue entitled “SI: NETYS 2019”

Computing. Archives for Informatics and Numerical Computation

Mohamed Faouzi Atig

2022/10/1

Verifying reachability for TSO programs with dynamic thread creation

Parosh Aziz Abdulla

Mohamed Faouzi Atig

Ahmed Bouajjani

K Narayan Kumar

Prakash Saivasan

2022/5/17

Probabilistic total store ordering

Parosh Aziz Abdulla

Mohamed Faouzi Atig

Raj Aryan Agarwal

Adwait Godbole

Krishna S

2022/3/29

Consistency and Persistency in Program Verification: Challenges and Opportunities

Parosh Aziz Abdulla

Mohamed Faouzi Atig

Ahmed Bouajjani

Bengt Jonsson

K Narayan Kumar

...

2022/12/29

Optimal Stateless Model Checking of Transactional Programs under Causal Consistency

arXiv preprint arXiv:2211.09020

Parosh Aziz Abdulla

Mohamed Faouzi Atig

Ashutosh Gupta

Shankaranarayanan Krishna

Omkar Tuppe

2022/11/16

Solving Not-Substring Constraint withFlat Abstraction

Parosh Aziz Abdulla

Mohamed Faouzi Atig

Yu-Fang Chen

Bui Phi Diep

Lukáš Holík

...

2021

The decidability of verification under PS 2.0

Parosh Aziz Abdulla

Mohamed Faouzi Atig

Adwait Godbole

S Krishna

Viktor Vafeiadis

2021

On the state reachability problem for concurrent programs under power

Parosh Aziz Abdulla

Mohamed Faouzi Atig

Ahmed Bouajjani

Egor Derevenetc

Carl Leonardsson

...

2021

What is decidable under the TSO memory model?

ACM SIGLOG News

Mohamed Faouzi Atig

2021/3/23

Deciding reachability under persistent x86-TSO

Proceedings of the ACM on Programming Languages

Parosh Aziz Abdulla

Mohamed Faouzi Atig

Ahmed Bouajjani

K Narayan Kumar

Prakash Saivasan

2021/1/4

Efficient handling of string-number conversion

Parosh Aziz Abdulla

Mohamed Faouzi Atig

Yu-Fang Chen

Bui Phi Diep

Julian Dolby

...

2020/6/11

Preface to the VECoS 2018 special issue of ISSE

Mohamed Faouzi Atig

Simon Bliudze

2020/6

On the separability problem of string constraints

arXiv preprint arXiv:2005.09489

Parosh Aziz Abdulla

Mohamed Faouzi Atig

Vrunda Dave

Shankara Narayanan Krishna

2020/5/18

See List of Professors in Mohamed Faouzi Atig University(Uppsala Universitet)