World's Best Scientists 2026 revealed!
Parosh Aziz Abdulla

Parosh Aziz Abdulla

D-Index & Metrics

Computer Science

D-Index
50
Citations
9080
World Ranking
5657
National Ranking
33

Overview

Parosh Aziz Abdulla is affiliated with Uppsala University in Sweden and has contributed extensively to the field of computer science with a focus on formal methods, distributed systems, and verification. Their research spans several interrelated domains including artificial intelligence, computational theory, computer networks, hardware architecture, and information systems.

The scientist's main fields of study include:

  • Computer Science

Within computer science, their work concentrates on several subfields:

  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Hardware and Architecture
  • Information Systems

Their research covers key topics such as:

  • Formal Methods in Verification
  • Distributed Systems and Fault Tolerance
  • Logic, Programming, and Type Systems
  • Parallel Computing and Optimization Techniques
  • Software Testing and Debugging Techniques
  • Security and Verification in Computing
  • Radiation Effects in Electronics

Parosh Aziz Abdulla has published numerous papers in scholarly venues. Frequent publication outlets include:

  • arXiv (Cornell University)
  • Proceedings of the ACM on Programming Languages
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • International Journal on Software Tools for Technology Transfer

Some recent scholarly contributions include:

  • "Deciding reachability under persistent x86-TSO," 2021, Proceedings of the ACM on Programming Languages
  • "Optimal Reads-From Consistency Checking for C11-Style Memory Models," 2023, Proceedings of the ACM on Programming Languages
  • "Verifying Quantum Circuits with Level-Synchronized Tree Automata," 2025, Proceedings of the ACM on Programming Languages
  • "The Decidability of Verification under Promising 2.0," 2020, arXiv (Cornell University)
  • "Parsimonious Optimal Dynamic Partial Order Reduction," 2024, arXiv (Cornell University)

The scientist has collaborated frequently with fellow researchers, including:

  • Mohamed Faouzi Atig
  • Shankara Narayanan Krishna
  • Adwait Godbole
  • Bengt Jönsson
  • Lukáš Holík

Best Publications

  • Stochastic games with lossy channels

    Parosh Aziz Abdulla;Noomene Ben Henda;Luca De Alfaro;Richard Mayr

  • General decidability theorems for infinite-state systems

    P.A. Abdulla;K. Cerans;B. Jonsson;Yih-Kuen Tsay

  • Verifying programs with unreliable channels

    P. Abdulla;B. Jonsson

  • Symbolic Reachability Analysis Based on SAT-Solvers

    Parosh Aziz Abdulla;Per Bjesse;Niklas Eén

  • Algorithmic Analysis of Programs with Well Quasi-ordered Domains

    Parosh Aziz Abdulla;Kārlis Čerāns;Bengt Jonsson;Yih-Kuen Tsay

  • Optimal dynamic partial order reduction

    Parosh Abdulla;Stavros Aronis;Bengt Jonsson;Konstantinos Sagonas

  • Timed Petri Nets and BQOs

    Parosh Aziz Abdulla;Aletta Nylén

  • On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels

    Parosh Aziz Abdulla;Ahmed Bouajjani;Bengt Jonsson

  • Designing safe, reliable systems using scade

    Parosh Aziz Abdulla;Johann Deneux;Gunnar Stalmarck;Herman Agren

  • A Survey of Regular Model Checking

    Parosh Aziz Abdulla;Bengt Jonsson;Marcus Nilsson;Mayank Saksena

  • Undecidable Verification Problems for Programs with Unreliable Channels

    Parosh Aziz Abdulla;Bengt Jonsson

  • Regular Tree Model Checking

    Parosh Aziz Abdulla;Bengt Jonsson;Pritha Mahata;Julien d'Orso

  • Stateless model checking for TSO and PSO

    Parosh Aziz Abdulla;Stavros Aronis;Mohamed Faouzi Atig;Bengt Jonsson

  • When simulation meets antichains: on checking language inclusion of nondeterministic finite (tree) automata

    Parosh Aziz Abdulla;Yu-Fang Chen;Lukáš Holík;Richard Mayr

  • String Constraints for Verification

    Parosh Aziz Abdulla;Mohamed Faouzi Atig;Yu-Fang Chen;Lukáš Holík

  • Handling Global Conditions in Parameterized System Verification

    Parosh Aziz Abdulla;Ahmed Bouajjani;Bengt Jonsson;Marcus Nilsson

  • Regular model checking without transducers (on efficient verification of parameterized systems)

    Parosh Aziz Abdulla;Giorgio Delzanno;Noomene Ben Henda;Ahmed Rezine

  • Using Forward Reachability Analysis for Verification of Lossy Channel Systems

    Parosh Aziz Abdulla;Aurore Collomb-Annichini;Ahmed Bouajjani;Bengt Jonsson

  • Advanced Ramsey-based Büchi automata inclusion testing

    Parosh Aziz Abdulla;Yu-Fang Chen;Lorenzo Clemente;Lukáš Holík

  • Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol

    Parosh Aziz Abdulla;Aurore Annichini;Ahmed Bouajjani

Frequent Co-Authors

Bengt Jonsson
Bengt Jonsson Uppsala University
Ahmed Bouajjani
Ahmed Bouajjani Université Paris Cité
Marco Montali
Marco Montali Free University of Bozen-Bolzano
Wang Yi
Wang Yi Uppsala University
K. Rustan M. Leino
K. Rustan M. Leino Amazon Web Services
Axel Legay
Axel Legay Université Catholique de Louvain
Joël Ouaknine
Joël Ouaknine Max Planck Institute for Software Systems
Stefanos Kaxiras
Stefanos Kaxiras Uppsala University
Christel Baier
Christel Baier TU Dresden
Doron Peled
Doron Peled Bar-Ilan University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online degree options is a smart way to build a foundation or deepen expertise in computer science and related fields. Many students start with an associate degree in 6 months online, which can quickly provide job-ready skills or a pathway toward a bachelor’s degree.

For those looking to advance their education while managing costs, consider enrolling in business degree online programs or exploring technology-focused equivalents. If leadership or education in technology interests you, cheapest online edd programs offer fast-track opportunities for professional growth.

Furthermore, professionals aiming for the highest credentials in their field can benefit from the most affordable online doctoral programs in computing and information technology. With flexible schedules and a variety of specialties, these online degrees support diverse career pathways—from software development and data analysis to technology management and academia.

Best Scientists Citing Parosh Aziz Abdulla

Trending Scientists

Recently Published Articles