MétaCan
Menu
Back to cohort
Record W4229000353 · doi:10.1145/3477314.3507053

Fighting evil is not enough when refactoring metamodels

2022· article· en· W4229000353 on OpenAlexaff
Oussama Ben Sghaier, Houari Sahraoui, Eugene Syriani

Bibliographic record

VenueProceedings of the 37th ACM/SIGAPP Symposium on Applied Computing · 2022
Typearticle
Languageen
FieldComputer Science
TopicSoftware Engineering Research
Canadian institutionsUniversité de Montréal
Fundersnot available
KeywordsCode refactoringCorrectnessComputer scienceContext (archaeology)Quality (philosophy)Task (project management)Process (computing)Set (abstract data type)Domain (mathematical analysis)MetamodelingSoftware engineeringHeuristicArtificial intelligenceProgramming languageSystems engineeringEngineeringSoftware

Abstract

fetched live from OpenAlex

In model-driven engineering, metamodels are central artifacts that allow to capture domain concepts and build domain-specific languages. However, bad design decisions, continuous changes, and the evolution of requirements may introduce bad smells and deteriorate the quality of metamodels. Refactoring metamodels is a complex task as it should be performed according to many conflicting quality attributes while maximizing the removal of smells. In this paper, we propose a generic automated approach based on a multi-objective heuristic search to refactor metamodels. The process aims at generating a set of refactoring recommendations with various quality trade-offs from which the modeler can choose the most appropriate for her context. We evaluate the efficiency of our approach with a user-based experiment, on time to perform understandability and extendibility tasks, as well as the correctness of the task output. Our results show that, globally, considering trade-offs between quality and smell removal is significantly better than focusing on smell removal alone. The observed difference is statistically significant for the extendibility but only partially for the understandability.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Open science
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.187
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0070.008
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.028
GPT teacher head0.248
Teacher spread0.220 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designBench or experimental
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2022
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of the 37th ACM/SIGAPP Symposium on Applied ComputingSame topicSoftware Engineering ResearchFrench-language works237,207