Demo Data from EDBT 2026 / reviewers in the wild / expert
Husain Aljazzar
dblp:86/3075
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
2 papers |
Automated reasoning and model checking · 47% Graph algorithms and graph theory · 33% Algorithms and data structures · 16% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures › search algorithms
heuristic search |
0.1 | 1 | 2011 | K⁎: A heuristic search algorithm for finding the k shortest paths · Artif. Intell. 2011 |
Graph algorithms and graph theory › shortest path
k shortest paths |
0.1 | 1 | 2011 | K⁎: A heuristic search algorithm for finding the k shortest paths · Artif. Intell. 2011 |
Graph algorithms and graph theory › graph algorithms › path problems
shortest path algorithms |
0.1 | 1 | 2011 | K⁎: A heuristic search algorithm for finding the k shortest paths · Artif. Intell. 2011 |
Automated reasoning and model checking › model checking
counterexample generation |
0.1 | 1 | 2010 | Directed Explicit State-Space Search in the Generation of Counterexamples for Stochastic Model Checking · IEEE Trans. Software Eng. 2010 |
Automated reasoning and model checking
model checking |
0.1 | 1 | 2010 | Directed Explicit State-Space Search in the Generation of Counterexamples for Stochastic Model Checking · IEEE Trans. Software Eng. 2010 |
Automated reasoning and model checking › model checking
probabilistic model checking |
0.1 | 1 | 2010 | Directed Explicit State-Space Search in the Generation of Counterexamples for Stochastic Model Checking · IEEE Trans. Software Eng. 2010 |
Mathematical optimization
markov chain analysis |
0.0 | 1 | 2010 | Directed Explicit State-Space Search in the Generation of Counterexamples for Stochastic Model Checking · IEEE Trans. Software Eng. 2010 |
Automated reasoning and model checking
probabilistic verification |
0.0 | 1 | 2010 | Directed Explicit State-Space Search in the Generation of Counterexamples for Stochastic Model Checking · IEEE Trans. Software Eng. 2010 |
Methods — techniques the papers use, named apart from their topics
heuristic search · 0.2a · 0.1directed explicit state-space search · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | K⁎: A heuristic search algorithm for finding the k shortest paths
Husain Aljazzar, Stefan Leue |
Artif. Intell. | 1 |
| 2010 | Directed Explicit State-Space Search in the Generation of Counterexamples for Stochastic Model CheckingabstractCurrent stochastic model checkers do not make counterexamples for property violations readily available. In this paper, we apply directed explicit state-space search to discrete and continuous-time Markov chains in order to compute counterexamples for the violation of PCTL or CSL properties. Directed explicit state-space search algorithms explore the state space on-the-fly, which makes our method very efficient and highly scalable. They can also be guided using heuristics which usually improve the performance of the method. Counterexamples provided by our method have two important properties. First, they include those traces which contribute the greatest amount of probability to the property violation. Hence, they show the most probable offending execution scenarios of the system. Second, the obtained counterexamples tend to be small. Hence, they can be effectively analyzed by a human user. Both properties make the counterexamples obtained by our method very useful for debugging purposes. We implemented our method based on the stochastic model checker PRISM and applied it to a number of case studies in order to illustrate its applicability. Husain Aljazzar, Stefan Leue |
IEEE Trans. Software Eng. | 1 |