MétaCan
Menu
Back to cohort
Record W4251245562 · doi:10.1002/stvr.396

Transition covering tests for systems with queues

2008· article· en· W4251245562 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

VenueSoftware Testing Verification and Reliability · 2008
Typearticle
Languageen
FieldComputer Science
TopicSoftware Testing and Debugging Techniques
Canadian institutionsComputer Research Institute of MontréalNortel (Canada)
Fundersnot available
KeywordsContext (archaeology)Computer scienceQueueMetric (unit)ConcurrencyCover (algebra)Model-based testingTest (biology)Test caseReliability engineeringDistributed computingProgramming languageEngineeringOperations managementMechanical engineering

Abstract

fetched live from OpenAlex

Abstract This paper introduces a method to cover transitions of a concurrent system under test through a context consisting of infinite‐capacity queues. Concurrent systems have many important applications, but they are very difficult and expensive to test. One of the difficulties in testing concurrent systems is caused by the fact that queues in the test context can distort the behaviour of a concurrent system under test and can cause state explosion in test derivation. The proposed method derives transition covering tests directly from the specification of a concurrent system, not its composition with queues. As transition coverage is an important industrial metric of test quality, the results of the paper have practical applications. A case study is presented to illustrate one of the applications. Copyright © 2008 John Wiley & Sons, Ltd.

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.001
metaresearch head score (Gemma)0.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.587
Threshold uncertainty score0.565

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
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.043
GPT teacher head0.260
Teacher spread0.216 · 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