MétaCan
Menu
Back to cohort

Eliminative Argumentation for Arguing System Safety - A Practitioner’s Experience

2020· article· en· W3111880994 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

Venue2020 IEEE International Systems Conference (SysCon) · 2020
Typearticle
Languageen
FieldEngineering
TopicSafety Systems Engineering in Autonomy
Canadian institutionsCritical Systems Labs
Fundersnot available
KeywordsArgumentation theorySafety caseArtifact (error)Risk analysis (engineering)NotationComputer scienceLife-critical systemSet (abstract data type)System safetyAutomotive industryDefeasible estateSoftwareEngineeringArtificial intelligenceBusinessReliability engineeringEpistemologyMathematicsProgramming language

Abstract

fetched live from OpenAlex

Safety cases are an essential artifact for establishing the safety of complex systems. Industrial use of safety cases varies between industries. Due to inconsistent regulatory guidance, numerous different strategies, notations, and techniques have been developed for safety case construction. Eliminative Argumentation (EA) has been proposed as a technique to systematically improve confidence in a safety case via `defeasible reasoning' wherein reasons to doubt safety claims are introduced and subsequently eliminated. Elimination of doubt results in increased confidence. This paper reports on the application of EA to seven different software-intensive systems in the automotive, rail, and industrial control industries. Our experiences suggest that EA's doubt-driven approach to safety argumentation increases confidence in a safety case and can be used to support activities such as independent safety assessments and safety verification and validation. From our experiences we synthesized into a set of lessons learned.

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 categoriesMeta-epidemiology (narrow)
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.980
Threshold uncertainty score1.000

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.001
Open science0.0010.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.037
GPT teacher head0.266
Teacher spread0.230 · 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