MétaCan
Menu
Back to cohort
Record W2129772051 · doi:10.1109/ares.2007.49

Automatic Failure Detection with Separation of Concerns

2007· article· en· W2129772051 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 Waterloo
Fundersnot available
KeywordsComputer scienceSession (web analytics)Rotation formalisms in three dimensionsFinite-state machineSeparation of concernsState (computer science)SoftwareReliability engineeringDistributed computingProgramming languageEngineering

Abstract

fetched live from OpenAlex

The paper considers automatic, specification-based detection of failures (differences between observed and specified behavior) in external behavior of software systems. The external behavior is recorded in traces, which are analyzed for the presence of failures. The paper describes a novel failure detection technique. The technique is applicable to multi-user systems which are reactive, session-oriented and specified in formalisms based on communicating extended finite state machines. It separates the failure detection concerns into two parts, the detection of failures directly noticeable by individual users, and the determination whether the individually correct local behaviors are globally consistent with the specification. An experimental evaluation of the technique on the control program for a small telephone exchange is also presented

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.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.955
Threshold uncertainty score0.145

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
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.016
GPT teacher head0.289
Teacher spread0.273 · 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