MétaCan
Menu
Back to cohort
Record W2541525300 · doi:10.1109/issoc.2004.1411185

Design for verification of a PCT bus in systemC

2005· article· en· W2541525300 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicEmbedded Systems Design Techniques
Canadian institutionsConcordia University
Fundersnot available
KeywordsSystemCComputer scienceEmbedded systemPCI configuration spaceTransaction-level modelingFinite-state machineUnified Modeling LanguageState (computer science)Computer architecturePCI ExpressProgramming languageSoftwareField-programmable gate array

Abstract

fetched live from OpenAlex

In this paper, we present an approach to design and verify SystemC intellectual properties (IPs). We considered as an illustrative case a PCI bus modeled as a monitor module that can be interfaced to existent SystemC IPs. We defined three design steps where we first model the bus in UML; then, design it completely with abstract state machines (ASM); and, finally, translate the ASM code to SystemC. We considered an intermediate ASM representation in order to extract the finite state machine of the bus that can be used for model checking of PSL properties. The final SystemC monitor block can be seen as a stand-alone PCI IP as well as a verification module to validate other SystemC PCI compatible devices. Besides, our design offers a flexible and easy to configure an IP that supports a large number of master/slave devices.

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 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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.700
Threshold uncertainty score0.230

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.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.049
GPT teacher head0.287
Teacher spread0.238 · 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

Quick stats

Citations15
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicEmbedded Systems Design TechniquesFrench-language works237,207