EDBT 2026 Demo / reviewers in the wild / expert
Leo Cacciari
dblp:31/3869
· DBLP profile ↗
5ranked-venue papers
4as first author
0since 2021 · last 2003
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 3 · 3 first-authorSoftware engineering, systems software and programming languages · 2 · 2 first-authorSystems, architecture and hardware · 1
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.
| Computer networks
1 paper |
Network management and operations · 100% | |
| Theoretical computer science
1 paper |
Computational complexity · 77% Automated reasoning and model checking · 23% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network management and operations › protocol verification
protocol validation |
0.0 | 1 | 1993 | Decidability issues in reduced reachability analysis · ICNP 1993 |
Network management and operations › network verification
reachability analysis |
0.0 | 1 | 1993 | Decidability issues in reduced reachability analysis · ICNP 1993 |
Computational complexity
decidability |
0.0 | 1 | 1993 | Decidability issues in reduced reachability analysis · ICNP 1993 |
Automated reasoning and model checking › model checking
state space reduction |
0.0 | 1 | 1993 | Decidability issues in reduced reachability analysis · ICNP 1993 |
Methods — techniques the papers use, named apart from their topics
reachability graph reduction · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2003 | Coordination Algorithm for Distributed Testing
Omar Rafiq, Leo Cacciari |
J. Supercomput. | 2 |
| 1999 | Controllability and observability in distributed testing
Leo Cacciari, Omar Rafiq |
Inf. Softw. Technol. | 1 |
| 1996 | Validation of protocols with temporal constraints
Leo Cacciari, Omar Rafiq |
Comput. Commun. | 1 |
| 1993 | Decidability issues in reduced reachability analysisabstractReachability analysis, which is the most used technique in protocol validation, is based on the construction of a graph called the reachability graph. However this technique has two serious drawbacks: the undecidability of the finiteness of the reachability graph and the state explosion when it is finite. To cope with the latter problem, reduction techniques are required. After a brief presentation of their reduced reachability graph the authors deal with related decidability issues and show how decidability results can be applied to the global reachability graph.> Leo Cacciari, Omar Rafiq |
ICNP | 1 |
| 1992 | On improving reduced reachability analysis
Leo Cacciari, Omar Rafiq |
FORTE | 1 |