Formal specification of CORBA-based distributed objects and behaviors
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
A distributed object system consists of a set of objects that interact by invoking services to one another. For successful cooperation between these objects, they must have capabilities that enable them to represent, use and share information. Existing middleware technologies define the remote object classes in terms of their interfaces only and do not give any semantic or behavioral specifications of the remote objects resident in clients and servers. This paper formalizes the behavior of distributed objects based on the Common Object Request Broker Architecture (CORBA). The capturing of information by each distributed object can be compared to the way information is captured using the Object-Attribute-Relation (OAR) model in which information about an object is represented by a 3-tuple (0, A, R), where O represents the object ID used to identify an object, A the set of object attributes used to denote detailed characteristics of an object and R a set of defined relationships used to make connections to other objects. Real-Time Process Algebra (RTPA) is used to model the architecture of a distributed system. Based on this architecture, a formal specification of the behavior of the distributed objects is presented through a case study.
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.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