MétaCan
Menu
Back to cohort
Record W2024965224 · doi:10.4236/jsea.2013.610a005

Traceability in Acceptance Testing

2013· article· en· W2024965224 on OpenAlexafffund
Jean‐Pierre Corriveau

Bibliographic record

VenueJournal of Software Engineering and Applications · 2013
Typearticle
Languageen
FieldComputer Science
TopicSoftware Testing and Debugging Techniques
Canadian institutionsOntario Tech UniversityCarleton University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsTraceabilityComputer scienceSoftware engineeringAcceptance testingRequirements traceabilityExecutableQuality (philosophy)Process (computing)StakeholderModel-based testingSystems engineeringTest strategyRisk analysis (engineering)SoftwareReliability engineeringTest caseSoftware developmentEngineeringRequirementProgramming language

Abstract

fetched live from OpenAlex

Regardless of which (model-centric or code-centric) development process is adopted, industrial software production ultimately and necessarily requires the delivery of an executable implementation. It is generally accepted that the quality of such an implementation is of utmost importance. Yet current verification techniques, including software testing, remain problematic. In this paper, we focus on acceptance testing, that is, on the validation of the actual behavior of the implementation under test against the requirements of stakeholder(s). This task must be as objective and automated as possible. Our first goal is to review existing code-based and model-based tools for testing in light of what such an objective and automated approach to acceptance testing entails. Our contention is that the difficulties we identify originate mainly in a lack of traceability between a testable model of the requirements of the stakeholder(s) and the test cases used to validate these requirements. We then investigate whether such traceability is addressed in other relevant specification-based approaches.

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.032
metaresearch head score (Gemma)0.191
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.032
Threshold uncertainty score0.169

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0320.191
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0050.003
Science and technology studies0.0020.010
Scholarly communication0.0050.015
Open science0.0040.004
Research integrity0.0050.005
Insufficient payload (model declined to judge)0.0050.001

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.013
GPT teacher head0.227
Teacher spread0.214 · 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 designNot applicable
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

Citations6
Published2013
Admission routes2
Has abstractyes

Explore more

Same venueJournal of Software Engineering and ApplicationsSame topicSoftware Testing and Debugging TechniquesFrench-language works237,207