A model driven framework for N-version programming
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.
Bibliographic record
Abstract
Complex systems-of-systems (SoS) requiring fault-tolerance and high reliability often require redundant systems. The concept of redundancy that includes components with differing failure modes is well understood in the realm of hardware design. N-version programming, although shown to produce significant gains in software reliability over single-version fault tolerant techniques, is not widely accepted or applied. This is due, in part, to N-version programming's lengthy development time and its inherent problems with version independence. Model Driven Software Development (MDSD) is a process that promises gains in software productivity and quality. While progress in MDSD has witnessed the expansion of the supporting Unified Modeling Language profile for modeling fault tolerant characteristics, and the development of specific design patterns for the production of fault tolerant software, MDSD's support in the generation and testing of fault tolerant applications is not evident or explicitly defined. This paper discusses the development of a fault tolerant MDSD framework, which enables users to design, implement and test fault tolerant applications using the N-version modeling technique. The framework closes the gap between existing modeling patterns and the practical application of fault tolerant MDSD, and supports follow-on research to address specific questions relating to the benefits of MDSD within the fault tolerance software domain.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it