H-Index & Metrics Top Publications
Parosh Aziz Abdulla

Parosh Aziz Abdulla

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 44 Citations 7,903 168 World Ranking 3798 National Ranking 20

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Algorithm
  • Operating system

Parosh Aziz Abdulla mainly investigates Theoretical computer science, Algorithm, Model checking, Reachability and Decidability. His Theoretical computer science research incorporates elements of Finite-state machine, Regular expression, Set and Constraint. His Algorithm study frequently draws connections between related disciplines such as Automaton.

His study looks at the relationship between Model checking and fields such as Temporal logic, as well as how they intersect with chemical problems. His research integrates issues of Petri net and Mutual exclusion in his study of Reachability. His research in Decidability intersects with topics in Regular language, State and Concurrency.

His most cited work include:

  • General decidability theorems for infinite-state systems (361 citations)
  • Verifying programs with unreliable channels (348 citations)
  • Symbolic Reachability Analysis Based on SAT-Solvers (178 citations)

What are the main themes of his work throughout his whole career to date?

Parosh Aziz Abdulla mainly focuses on Theoretical computer science, Model checking, Algorithm, Automaton and Decidability. Parosh Aziz Abdulla has researched Theoretical computer science in several fields, including Correctness, Petri net and Parameterized complexity. His Model checking research includes themes of Stateless protocol, Transitive closure, POSIX Threads and Concurrency.

His Algorithm research includes elements of Probabilistic logic and Set. His Automaton research is multidisciplinary, relying on both Nondeterministic algorithm and State. His Decidability study introduces a deeper knowledge of Discrete mathematics.

He most often published in these fields:

  • Theoretical computer science (40.80%)
  • Model checking (23.20%)
  • Algorithm (20.27%)

What were the highlights of his more recent work (between 2015-2021)?

  • Theoretical computer science (40.80%)
  • Model checking (23.20%)
  • Decidability (17.33%)

In recent papers he was focusing on the following fields of study:

His primary scientific interests are in Theoretical computer science, Model checking, Decidability, Undecidable problem and Reachability problem. His work deals with themes such as Memory model and Algorithm, Correctness, Petri net, which intersect with Theoretical computer science. His studies in Model checking integrate themes in fields like Stateless protocol, Time complexity, Parameterized complexity, Concurrency and POSIX Threads.

The subject of his Decidability research is within the realm of Discrete mathematics. His work carried out in the field of Undecidable problem brings together such families of science as Fragment, Relational database, EXPTIME and Boolean satisfiability problem. His Reachability problem research integrates issues from Bounded function and State.

Between 2015 and 2021, his most popular works were:

  • Stateless Model Checking for POWER (36 citations)
  • Parameterized verification through view abstraction (30 citations)
  • Flatten and conquer: a framework for efficient analysis of string constraints (29 citations)

In his most recent research, the most cited papers focused on:

  • Programming language
  • Operating system
  • Algorithm

Parosh Aziz Abdulla focuses on Theoretical computer science, Model checking, Programming language, Undecidable problem and Semantics. Specifically, his work in Theoretical computer science is concerned with the study of Automaton. His Model checking research is multidisciplinary, incorporating perspectives in Stateless protocol, POSIX Threads, Relation and Time complexity.

His study in the fields of Formal verification, Queue, Concurrent data structure and Linearizability under the domain of Programming language overlaps with other disciplines such as Point placement. His Undecidable problem study combines topics in areas such as Reachability and Boolean satisfiability problem. His Semantics research is multidisciplinary, incorporating elements of Memory model and Bounded function.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

General decidability theorems for infinite-state systems

P.A. Abdulla;K. Cerans;B. Jonsson;Yih-Kuen Tsay.
logic in computer science (1996)

573 Citations

Verifying programs with unreliable channels

P. Abdulla;B. Jonsson.
logic in computer science (1993)

534 Citations

Symbolic Reachability Analysis Based on SAT-Solvers

Parosh Aziz Abdulla;Per Bjesse;Niklas Eén.
tools and algorithms for construction and analysis of systems (2000)

278 Citations

Algorithmic Analysis of Programs with Well Quasi-ordered Domains

Parosh Aziz Abdulla;Kārlis Čerāns;Bengt Jonsson;Yih-Kuen Tsay.
Information & Computation (2000)

247 Citations

Timed Petri Nets and BQOs

Parosh Aziz Abdulla;Aletta Nylén.
applications and theory of petri nets (2001)

207 Citations

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

Parosh Aziz Abdulla;Ahmed Bouajjani;Bengt Jonsson.
computer aided verification (1998)

202 Citations

Optimal dynamic partial order reduction

Parosh Abdulla;Stavros Aronis;Bengt Jonsson;Konstantinos Sagonas.
symposium on principles of programming languages (2014)

175 Citations

A Survey of Regular Model Checking

Parosh Aziz Abdulla;Bengt Jonsson;Marcus Nilsson;Mayank Saksena.
international conference on concurrency theory (2004)

172 Citations

Undecidable Verification Problems for Programs with Unreliable Channels

Parosh Aziz Abdulla;Bengt Jonsson.
Information & Computation (1996)

150 Citations

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

Parosh Aziz Abdulla;Yu-Fang Chen;Lukáš Holík;Richard Mayr.
tools and algorithms for construction and analysis of systems (2010)

134 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

Top Scientists Citing Parosh Aziz Abdulla

Ahmed Bouajjani

Ahmed Bouajjani

Université Paris Cité

Publications: 65

Rupak Majumdar

Rupak Majumdar

Max Planck Institute for Software Systems

Publications: 39

Javier Esparza

Javier Esparza

Technical University of Munich

Publications: 33

Jean-François Raskin

Jean-François Raskin

Université Libre de Bruxelles

Publications: 32

Axel Legay

Axel Legay

Université Catholique de Louvain

Publications: 25

Silvio Ranise

Silvio Ranise

Fondazione Bruno Kessler

Publications: 24

Patricia Bouyer

Patricia Bouyer

University of Paris-Saclay

Publications: 24

Christel Baier

Christel Baier

TU Dresden

Publications: 23

Kim Guldstrand Larsen

Kim Guldstrand Larsen

Aalborg University

Publications: 21

Gianluigi Zavattaro

Gianluigi Zavattaro

University of Bologna

Publications: 20

Daniel Kroening

Daniel Kroening

Amazon (United States)

Publications: 18

Joël Ouaknine

Joël Ouaknine

Max Planck Society

Publications: 16

Andreas Podelski

Andreas Podelski

University of Freiburg

Publications: 16

Krishnendu Chatterjee

Krishnendu Chatterjee

Institute of Science and Technology Austria

Publications: 14

James Worrell

James Worrell

University of Oxford

Publications: 14

Something went wrong. Please try again later.