Design of an Automatic Test Case Generator for Embedded C Compilers
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
The paper firstly proposes an approach to test and verify embedded C compilers,where the variables outputted from the tested program are sent back via serial port to verify the correctness of the compiler. And then an automatic test case generator for embedded C compiler which is named ECPAG (Embedded C Program Automatic Generator) is designed. The ECPAG uses a stochastic algorithm to randomly combine different syntax according to embedded C language syntax so as to generate test cases (in our context – a program),and utilizes a probabilistic algorithm to restrict the generation probability of each syntax. The generator also utilizes a depth-first search on the function call graph to avoid the appearance of recursive calls in random invocations. Practice evaluation shows that test cases generated by the automatic tool can cover syntax and semantics of embedded C language well,and a block-coverage in the excess of 75% is achieved.
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