MétaCan
Menu
Back to cohort
Record W2161320179 · doi:10.1109/iccd.1998.727045

Model checking of a real ATM switch

2002· article· en· W2161320179 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
TopicFormal Methods in Verification
Canadian institutionsUniversité de MontréalConcordia University
FundersScheme for Promotion of Academic and Research Collaboration
KeywordsComputer scienceFIFO (computing and electronics)Asynchronous Transfer ModeModel checkingAsynchronous communicationAbstractionNetwork switchState (computer science)Embedded systemTransfer (computing)State spaceParallel computingComputer hardwareComputer networkProgramming language

Abstract

fetched live from OpenAlex

In this paper we present our experience on model checking of an Asynchronous Transfer Mode (ATM) switch using the Verification Interacting with Synthesis (VIS) tool. The switch we considered is in use for real applications in the Cambridge Fairisle network. It is composed of four input/output port controllers and a switch fabric, and contains around 1 MB memory, 2 KB FIFO buffer and 800 registers (latches). To overcome state space explosion, we adopted several abstraction and reduction techniques to reduce the model, and applied compositional reasoning combined with a novel property division approach. Using the above techniques, we succeeded in verifying the entire switch at different hierarchy levels within reasonable CPU time.

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.000
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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.979
Threshold uncertainty score0.153

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.113
GPT teacher head0.308
Teacher spread0.195 · 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

Citations10
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicFormal Methods in VerificationFrench-language works237,207