H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 48 Citations 7,948 119 World Ranking 3146 National Ranking 67

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Algorithm
  • Theoretical computer science

Ahmed Bouajjani mostly deals with Theoretical computer science, Model checking, Automaton, Reachability and Algorithm. Ahmed Bouajjani combines subjects such as Programming language and Computation with his study of Theoretical computer science. Ahmed Bouajjani works mostly in the field of Model checking, limiting it down to topics relating to Data structure and, in certain cases, Linked list and Heap.

His Automaton research is multidisciplinary, relying on both Program analysis, Word, Temporal logic and Symbolic trajectory evaluation. His study in Reachability is interdisciplinary in nature, drawing from both Finite-state machine and Discrete mathematics. His work in Algorithm addresses issues such as Lossy compression, which are connected to fields such as Regular expression, Time complexity, Vector addition and Computation tree logic.

His most cited work include:

  • Reachability Analysis of Pushdown Automata: Application to Model-Checking (624 citations)
  • Property preserving abstractions for the verification of concurrent systems (332 citations)
  • Regular Model Checking (233 citations)

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

His scientific interests lie mostly in Theoretical computer science, Reachability, Decidability, Model checking and Algorithm. In his study, Pointer is strongly linked to Data structure, which falls under the umbrella field of Theoretical computer science. The Reachability study combines topics in areas such as Discrete mathematics, Petri net, Concurrency, Finite-state machine and Computation.

As part of the same scientific family, Ahmed Bouajjani usually focuses on Decidability, concentrating on Correctness and intersecting with Distributed computing. As a part of the same scientific family, Ahmed Bouajjani mostly works in the field of Model checking, focusing on Temporal logic and, on occasion, Timed automaton and Linear temporal logic. His Tree study in the realm of Algorithm interacts with subjects such as Parametric statistics.

He most often published in these fields:

  • Theoretical computer science (63.59%)
  • Reachability (32.31%)
  • Decidability (28.21%)

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

  • Theoretical computer science (63.59%)
  • Reachability (32.31%)
  • Reachability problem (17.95%)

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

Ahmed Bouajjani mainly focuses on Theoretical computer science, Reachability, Reachability problem, Correctness and Decidability. Ahmed Bouajjani incorporates Theoretical computer science and Bounded function in his research. In his research on the topic of Reachability, Reduction and Automaton is strongly related with Programming language.

His work in Correctness covers topics such as Distributed computing which are related to areas like Event and Static program analysis. His Decidability research incorporates elements of Semantics, State, Task and Extension. His Model checking study combines topics from a wide range of disciplines, such as Abstract interpretation, Optimistic replication and Feature.

Between 2013 and 2021, his most popular works were:

  • Verifying eventual consistency of optimistic replication systems (39 citations)
  • Tractable Refinement Checking for Concurrent Objects (37 citations)
  • On verifying causal consistency (27 citations)

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

  • Programming language
  • Algorithm
  • Theoretical computer science

The scientist’s investigation covers issues in Theoretical computer science, Reachability, Correctness, Bounded function and Decidability. His Theoretical computer science study combines topics in areas such as Memory model, Thread and Concurrency. His biological study spans a wide range of topics, including Distributed computing and Shared memory.

Ahmed Bouajjani studied Correctness and Data structure that intersect with Reference implementation, Mathematical proof and Consistency. His Decidability study integrates concerns from other disciplines, such as Semantics and State. His work focuses on many connections between Reachability problem and other disciplines, such as Model checking, that overlap with his field of interest in Causal consistency.

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

Reachability Analysis of Pushdown Automata: Application to Model-Checking

Ahmed Bouajjani;Javier Esparza;Oded Maler.
international conference on concurrency theory (1997)

833 Citations

Property preserving abstractions for the verification of concurrent systems

C. Loiseaux;S. Graf;J. Sifakis;A. Bouajjani.
computer aided verification (1995)

539 Citations

Regular Model Checking

A. Bouajjani;B. Jonsson;M. Nilsson;T. Touili.
computer aided verification (2000)

365 Citations

A generic approach to the static analysis of concurrent programs with procedures

Ahmed Bouajjani;Javier Esparza;Tayssir Touili.
symposium on principles of programming languages (2003)

210 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

Abstract Regular Model Checking

Ahmed Bouajjani;Peter Habermehl;Tomas Vojnar.
computer aided verification (2004)

202 Citations

Minimal Model Generation

Ahmed Bouajjani;Jean-Claude Fernandez;Nicolas Halbwachs.
computer aided verification (1990)

198 Citations

On the verification problem for weak memory models

Mohamed Faouzi Atig;Ahmed Bouajjani;Sebastian Burckhardt;Madanlal Musuvathi.
symposium on principles of programming languages (2010)

167 Citations

TReX: A Tool for Reachability Analysis of Complex Systems

Aurore Annichini;Ahmed Bouajjani;Mihaela Sighireanu.
computer aided verification (2001)

153 Citations

Regular symbolic analysis of dynamic networks of pushdown systems

Ahmed Bouajjani;Markus Müller-Olm;Tayssir Touili.
international conference on concurrency theory (2005)

150 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 Ahmed Bouajjani

Parosh Aziz Abdulla

Parosh Aziz Abdulla

Uppsala University

Publications: 96

Thomas Reps

Thomas Reps

University of Wisconsin–Madison

Publications: 56

Rupak Majumdar

Rupak Majumdar

Max Planck Institute for Software Systems

Publications: 44

Javier Esparza

Javier Esparza

Technical University of Munich

Publications: 42

Thomas A. Henzinger

Thomas A. Henzinger

Institute of Science and Technology Austria

Publications: 39

Rajeev Alur

Rajeev Alur

University of Pennsylvania

Publications: 37

Marius Bozga

Marius Bozga

Grenoble Alpes University

Publications: 35

Jean-François Raskin

Jean-François Raskin

Université Libre de Bruxelles

Publications: 35

P. Madhusudan

P. Madhusudan

University of Illinois at Urbana-Champaign

Publications: 33

Bengt Jonsson

Bengt Jonsson

Uppsala University

Publications: 31

Axel Legay

Axel Legay

Université Catholique de Louvain

Publications: 28

Orna Grumberg

Orna Grumberg

Technion – Israel Institute of Technology

Publications: 25

Andreas Podelski

Andreas Podelski

University of Freiburg

Publications: 25

Orna Kupferman

Orna Kupferman

Hebrew University of Jerusalem

Publications: 24

Oscar H. Ibarra

Oscar H. Ibarra

University of California, Santa Barbara

Publications: 24

Something went wrong. Please try again later.