Demo Data from SIGIR 2026 / reviewers in the wild / expert
Martin Faunes
dblp:02/9883
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 3 · 2 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.
| Software engineering, system software, and programming languages
1 paper |
Requirements engineering and software design · 50% Program synthesis and code generation · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Requirements engineering and software design
model-driven engineering |
0.1 | 1 | 2012 | Generating model transformation rules from examples using an evolutionary algorithm · ASE 2012 |
Program synthesis and code generation
programming by example |
0.1 | 1 | 2012 | Generating model transformation rules from examples using an evolutionary algorithm · ASE 2012 |
Methods — techniques the papers use, named apart from their topics
genetic programming · 0.1evolutionary algorithm · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Learning Implicit and Explicit Control in Model Transformations by Example
Islem Baki, Houari Sahraoui, Quentin Cobbaert, Philippe Masson, Martin Faunes |
MoDELS | 5 |
| 2013 | Automatically Searching for Metamodel Well-Formedness Rules in Examples and Counter-Examples
Martin Faunes, Juan José Cadavid, Benoit Baudry, Houari Sahraoui, Benoît Combemale |
MoDELS | 1 |
| 2012 | Generating model transformation rules from examples using an evolutionary algorithmabstractWe propose an evolutionary approach to automatically generate model transformation rules from a set of examples. To this end, genetic programming is adapted to the problem of model transformation in the presence of complex input/output relationships (i.e., models conforming to meta-models) by generating declarative programs (i.e., transformation rules in this case). Our approach does not rely on prior transformation traces for the model-example pairs, and directly generates executable, many-to-many rules with complex conditions. The applicability of the approach is illustrated with the well-known problem of transforming UML class diagrams into relational schemas, using examples collected from the literature. Martin Faunes, Houari Sahraoui, Mounir Boukadoum |
ASE | 1 |