Design-Level Detection of Interactions in Aspect-UML Models Using Alloy.
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Aspect-oriented (AO) programming has emerged as a promising paradigm to improve modularity by providing mechanisms to capture and execute crosscutting concerns in software applications. Among others, AO allows developers to incrementally modify the behavior of a base program, by introducing aspects which implement crosscutting concerns having effects at various points throughout a program. Hence, despite the clean separation of concerns in aspect-oriented systems, it remains difficult to predict the effect of a given aspect on this base program. Once woven, does an aspect still achieve what it was intended for? Does it violate base program properties that should be preserved? Does it interfere with the properties of other aspects? These questions address the well known aspect interaction problem, encountered within the AO paradigm. This article tackles the interaction problem in the context of formal AO system model analysis and verification. To be more precise, this work considers AO models written in Aspect-UML (our UML profile). Aspect-UML does not depend on any AO language specific features nor is it associated with any specific development process. This paper first explains how Aspect-UML models can be translated into Alloy, a simple structural first-order logic modeling language which can be formally analyzed. Given this translation, it then demonstrates how Alloy's model analyzer can be used to verify aspect interactions of an Aspect-UML model.
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.
Full frame distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it