Model Checker to FPGA Prototype Commmunication Bottleneck Issue
Bibliographic record
Abstract
The main problem we met, when applying the TLC Model Checker to the verification of a Field Programmable Gate Array (FPGA)-based prototype [1], was the large delay introduced by the latency of the communication link. We have performed actual measurements on different FPGA platforms, and from these measurements we could elaborate a model or a set of mathematical formulas for the communication link. These suggested that we had to combine multiple packets in a single transfer to overcome the bottleneck issue. To do this, we had to anticipate TLC's future needs and obtain them automatically via transfers which are as large as possible and hence reduce the effect of link latency. For this purpose we made software and hardware memory (RAM) structures to buffer the packets going between TLC and the target implementation. We also had to develop strategies for more performance by improving these memories's organization and accessibility. An Embedded Reachability Analyzer And Invariant Checker (ERAIC) [2], part of our new methodology for Formal Verification of "Concrete" Digital Circuits, is essential. When combined with the memories, the ERAIC essentially eliminated the communication overhead. The mechanism relies on full state controllability and observability, and offers more performance, flexibility, portability, and furthermore, the possibility of checking invariants on the Implementation Under Test (IUT) before submitting it to the model checker.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.011 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".