MétaCan
Menu
Back to cohort
Record W2951101154 · doi:10.1109/icstw.2019.00029

Using Imprecise Test Oracles Modelled by FSM

2019· article· en· W2951101154 on OpenAlexaff
Omer Nguena Timo, Alexandre Petrenko, S. Ramesh

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicSoftware Testing and Debugging Techniques
Canadian institutionsComputer Research Institute of Montréal
Fundersnot available
KeywordsOracleNondeterministic algorithmComputer scienceContext (archaeology)Finite-state machineConformance testingSet (abstract data type)Test caseTheoretical computer scienceAlgorithmMachine learningProgramming language

Abstract

fetched live from OpenAlex

Test oracles are usually used to evaluate the behaviors of systems under test to reveal faults. In a typical conformance testing scenario, a test oracle is a deterministic finite state machine (FSM). However, uncertainty occurring in the design of an oracle may result in a set of potential candidate oracles which can compactly be represented by a nondeterministic FSM thus modelling an imprecise test oracle. In the context of testing deterministic systems, such an oracle should ideally be reduced to a precise, i.e., deterministic oracle. We elaborate two scenarios for dealing with imprecise test oracles that involve a domain expert playing the role of an "ultimate" oracle. In the first scenario, the expert chooses a right oracle by inspecting the generated tests differentiating all potential precise oracles which can be derived from a given imprecise one. In the second scenario, the expert evaluates tests one by one while they are generated, and the imprecise oracle is iteratively reduced until a single precise oracle remains, if at all.

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.007
metaresearch head score (Gemma)0.032
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.007
Threshold uncertainty score0.038

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0070.032
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0030.001
Science and technology studies0.0010.005
Scholarly communication0.0040.007
Open science0.0030.003
Research integrity0.0030.003
Insufficient payload (model declined to judge)0.0030.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.028
GPT teacher head0.273
Teacher spread0.245 · 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 designSimulation or modeling
Domainnot available
GenreEmpirical

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

Citations2
Published2019
Admission routes1
Has abstractyes

Explore more

Same topicSoftware Testing and Debugging TechniquesFrench-language works237,207