Control of nondeterminism in testing distributed multithreaded programs
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
Distributed and multithreaded systems are usually much more complex to analyze statically or test dynamically due to the nondeterminism involved. Forcing the system to take a particular execution path manually may be fairly difficult sometimes. In this paper, we present our work in test control methods for distributed concurrent systems, and introduce the framework of our automated test control toolkit that can help users to realize some particular execution paths desired. The testing is specification-based: a test scenario is given as a pair of a test case and a control constraint expressing the partial order among certain events we are interested in. The test control is however based on a derived constraint only on shared objects. This allows us to develop more efficient test tools based on some unique code extension for different test scenarios. In our experiment, systems under testing consist of a set of processes, each in Java possibly with multiple threads, and communications among the processes are through CORBA.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| 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