MétaCan
Menu
Back to cohort
Record W2002136372 · doi:10.1145/1363686.1363857

An approach for supporting system-level test scenarios generation from textual use cases

2008· article· en· W2002136372 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicSoftware Testing and Debugging Techniques
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceTree traversalControl flowFinite-state machineTest (biology)Scenario testingTest caseState (computer science)Code coverageProgramming languageTheoretical computer scienceArtificial intelligenceMachine learningSoftware

Abstract

fetched live from OpenAlex

This paper presents an approach for system-level test scenarios generation from use cases in text form. Test scenarios are linear sequences of events used as intermediate representations toward complete test cases. A restricted form of natural language is used for use cases description. We start by generating control flow-based state machines from each use case. These state machines are then connected in a global system-level state machine according to derived sequencing relations between use cases. We infer sequencing relations based on a comparison of use cases pre-conditions and post-conditions. Test scenarios are generated using depth-first traversal of the generated control flow-based state machines according to criteria inspired from traditional white-box code coverage.

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 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.000
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.988
Threshold uncertainty score0.534

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
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.161
GPT teacher head0.303
Teacher spread0.141 · 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

Quick stats

Citations25
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicSoftware Testing and Debugging TechniquesFrench-language works237,207