MétaCan
Menu
Back to cohort
Record W2027206582 · doi:10.5220/0005249102030209

Towards an Explicit Bidirectional Requirement-to-Code Traceability Meta-model for the PASSI Methodology

2015· article· en· W2027206582 on OpenAlexaff
Mihoub Mazouz, Farid Mokhati, Mourad Badri

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMulti-Agent Systems and Negotiation
Canadian institutionsUniversité du Québec
Fundersnot available
KeywordsTraceabilityComputer scienceRequirements traceabilityProcess (computing)Software engineeringIterative and incremental developmentModel-based designRisk analysis (engineering)Systems engineeringProcess managementRequirements analysisRequirementProgramming languageSimulationEngineeringSoftware

Abstract

fetched live from OpenAlex

Traceability plays an important role in the development of computing systems, specifically, the complex ones. It provides several benefits to stakeholders and developers during the different phases of the systems development life cycle, including verification & validation and maintenance. Unfortunately, there are very few works in literature addressing the concept of traceability in multi-agent systems development methodologies. Having an incremental and iterative process, the well-known PASSI (Process for Agent Societies Specification and Implementation) methodology needs an explicit traceability in order to facilitate the understanding of the MAS under development and to better manage the changes occurring during the development process. In addition, it can lead to a requirement-based verification & validation. In this paper, we propose a new traceability meta-model for the PASSI methodology by introducing explicit traceability links of functional requirements through the various phases of the development life cycle.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.014
metaresearch head score (Gemma)0.023
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.014
Threshold uncertainty score0.076

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0140.023
Meta-epidemiology (narrow)0.0020.002
Meta-epidemiology (broad)0.0010.004
Bibliometrics0.0040.002
Science and technology studies0.0010.003
Scholarly communication0.0070.008
Open science0.0050.006
Research integrity0.0040.008
Insufficient payload (model declined to judge)0.0030.002

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.591
GPT teacher head0.430
Teacher spread0.161 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

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
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicMulti-Agent Systems and NegotiationFrench-language works237,207