Demo Data from EDBT 2026 / reviewers in the wild / expert
Pierre Moro
dblp:72/3204
· DBLP profile ↗
4ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 2Theory of computation · 2Artificial intelligence and machine learning · 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.
| Software engineering, system software, and programming languages
1 paper |
Program verification · 77% Program analysis · 23% | |
| Theoretical computer science
1 paper |
Automata and formal languages · 100% |
Topics — the 1 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automata and formal languages
counter machines |
0.1 | 1 | 2006 | Programs with Lists Are Counter Automata · CAV 2006 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | Robustness Analysis for Scheduling Problems Using the Inverse MethodabstractGiven a Parametric Timed Automaton (PTA) A and a reference valuation for timings, the Inverse Method (IM) synthesizes a constraint around the reference valuation where A behaves in the same time-abstract manner. This provides us with a quantitative measure of robustness of the behavior of A around the reference valuation. We show in this paper how IM can be applied in a specific way to treat the robustness of scheduling systems. We also explain how to use the method in order to synthesize large zones of the timing parameter space where the system is guaranteed to be schedulable. We illustrate the method on several examples of the literature as well as a case study originating from an industrial design project. Laurent Fribourg, Romain Soulat, David Lesens, Pierre Moro |
TIME | 4 |
| 2011 | Programs with lists are counter automata
Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Pierre Moro, Tomás Vojnar |
Formal Methods Syst. Des. | 5 |
| 2006 | Programs with Lists Are Counter Automata
Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Pierre Moro, Tomás Vojnar |
CAV | 5 |
| 2005 | Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking
Ahmed Bouajjani, Peter Habermehl, Pierre Moro, Tomás Vojnar |
TACAS | 3 |