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.
