Demo Data from EDBT 2026 / reviewers in the wild / expert
Alexandre Genon
dblp:69/6016
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2006
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 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
1 paper |
Automated reasoning and model checking · 87% Logic in computer science · 13% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems › distributed control
distributed controllers |
0.1 | 1 | 2006 | Monitoring Distributed Controllers: When an Efficient LTL Algorithm on Sequences Is Needed to Model-Check Traces · FM 2006 |
Automated reasoning and model checking › model checking › temporal logic model checking
LTL model checking |
0.1 | 1 | 2006 | Monitoring Distributed Controllers: When an Efficient LTL Algorithm on Sequences Is Needed to Model-Check Traces · FM 2006 |
Automated reasoning and model checking
model checking |
0.1 | 1 | 2006 | Monitoring Distributed Controllers: When an Efficient LTL Algorithm on Sequences Is Needed to Model-Check Traces · FM 2006 |
Logic in computer science › temporal logic
linear temporal logic |
0.0 | 1 | 2006 | Monitoring Distributed Controllers: When an Efficient LTL Algorithm on Sequences Is Needed to Model-Check Traces · FM 2006 |
Methods — techniques the papers use, named apart from their topics
LTL algorithm · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | Monitoring Distributed Controllers: When an Efficient LTL Algorithm on Sequences Is Needed to Model-Check Traces
Alexandre Genon, Thierry Massart, Cédric Meuter |
FM | 1 |
| 2005 | The formal design of distributed controllers with dSL and SpinabstractAbstract We study the formal verification of programs written in d SL, an extension of the standard ST language used to program industrial controllers. It proposes a trade off between industrial and formal verification worlds. The main advantage of d SL is to provide a transparent code distribution through low level communication mechanisms. The behavior of the synthesized distributed system can therefore be formally modeled, easily monitored and formally verified. The verification of a d SL program, realized with the Spin tool, is eased by the definition of a lattice of models linked with a simulation relation preserving next-free LTL formulae. We show that, although d SL is an industrial programming language, it gives the possibility to verify systems designed with it. We illustrate the benefit of our approach with a simple control system of two canal locks. Bram De Wachter, Alexandre Genon, Thierry Massart, Cédric Meuter |
Formal Aspects Comput. | 2 |