MétaCan
Menu
Back to cohort
Record W2116868051 · doi:10.1109/ccece.2005.1557217

An executable specification of the PCI-X bus standard in AsmL

2006· article· en· W2116868051 on OpenAlexaff
H. Moinudeen, Ali Habibi, Sofiène Tahar

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicFormal Methods in Verification
Canadian institutionsConcordia University
Fundersnot available
KeywordsConventional PCIPCI configuration spaceExecutableComputer scienceProgramming languageAbstract state machinesUnified Modeling LanguageExtension (predicate logic)Finite-state machineOperating systemEmbedded systemSystem busSoftwareControl bus

Abstract

fetched live from OpenAlex

In this paper, we describe an executable formal specification of the PCI-X bus standard using the abstract state machines language, AsmL. PCI-X, is the latest extension of the PCI local bus that is designed to meet increased I/O demands of recent technologies. The actual specification of PCI-X, provided by the PCI special interest group (PCI-SIG), is informal (in natural English). Hence, it is prone to inherent problems of incompleteness, inconsistency and ambiguity. In our approach, we first model the bus in UML and then map it to AsmL. This AsmL model can be executed using the Asmlt tool that can generate the finite state machine (FSM) of the model. Such FSM can be of great use for verification purposes

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.911
Threshold uncertainty score0.144

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.013
GPT teacher head0.264
Teacher spread0.251 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

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".

Quick stats

Citations1
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicFormal Methods in VerificationFrench-language works237,207