Bibliographic record
Abstract
<p>Concurrent Transaction Logic (CTTZ) is a deductive language for programming database transaction applications that integrates queries, updates, and transaction composition in a complete logical framework. The language supports all the properties of classical transactions and the properties found in some new transaction models, e.g., sub-transactions, transaction rollback, and concurrent transactions. </p> <p>The contributions of this thesis are twofold. First, it extends CTTZ to account for timing-event-based prioritized concurrent systems in which transactions may have priority and timing constraints. This extension of CTTZ, here called TV-CTTZ, provides a high-level logic programming framework for specifying and simulating executions of timed transactions and trigger-events commonly present in real-time concurrent applications. Second, it describes a Prolog implementation of TV-CTTZ. The implemented TV-CTTZ prototype supports the translation from TV-CTTZ to CTTZ. Underlying this protocol, we use a simplified Rate-Monotonic algorithm [10] to schedule the execution of constraint concurrent transactions and built-in timing predicates to handle transaction time-relations.</p>
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 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.001 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".