AdvancingModel-Based Design by Modeling Approximations of Computational Semantics
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
Over the past decades, engineered systems have increasingly come to rely on embedded computation in order to include advanced and sophisticated features. The unparallelled flexibility of software has been a blessing for implementing functionality with a complexity that could not have been imagined heretofore. One important manifestation of this is in the use of software as the universal system integration mechanism. With the increasing use, however, has come a suite of difficulties in effectively employing software engineering practices because (i) C (the language of choice in embedded software implementation) is very close to the hardware implementation and (ii) software engineering methods typically only consider logical correctness, irrespective of critical characteristics for embedded computation (e.g., response time). To address these problems, Model-Based Design helps raise the level of abstraction while accounting for such critical characteristics. The corresponding models are designed using high-level formalisms such as block diagrams and state transition diagrams whose meaning is particularly intuitive because of their executable nature. The necessity to support increasingly complicated language elements, however, has caused the underlying execution engine to explode in complexity. As a result, the meaning of the high-level formalisms exists almost exclusively by merit of simulation. This paper attempts to present the challenges faced by the current state of Model-Based Design tools and outlines a solution approach by modeling the execution engine.
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.001 | 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.001 |
| Open science | 0.000 | 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