MétaCan
Menu
Back to cohort
Record W2545534145 · doi:10.1109/edtc.1994.326876

An extended OBDD representation for extended FSMs

2002· article· en· W2545534145 on OpenAlex
M. Langevin, E. Cerny

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.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicFormal Methods in Verification
Canadian institutionsUniversité de Montréal
FundersNatural Sciences and Engineering Research Council of CanadaÉcole Polytechnique Fédérale de LausanneCMC Microsystems
KeywordsComputer scienceDatapathBinary decision diagramTheoretical computer scienceFinite-state machineProgramming languageRepresentation (politics)Predicate (mathematical logic)Formal verificationAlgorithmParallel computing

Abstract

fetched live from OpenAlex

This paper presents a subset of the predicate calculus, called the case calculus, which is suitable for describing Extended Finite State Machines (EFSMs). EFSMs can be used as abstract models of combined datapath and control systems. Case expressions can be represented using Extended Ordered Binary Decision Diagrams (EOBDDs) that are compact, allow an efficient implementation of logical operations on expressions, and have a unique form for many semantically equivalent expressions. Operations for formal verification and synthesis based on EFSM models, such as the "pre" and "post"" operations on sets of states, can be efficiently implemented. We illustrate the usefulness of EOBDDs in design verification and microcode synthesis.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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.923
Threshold uncertainty score0.346

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.001
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.091
GPT teacher head0.368
Teacher spread0.277 · 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

Citations7
Published2002
Admission routes2
Has abstractyes

Explore more

Same topicFormal Methods in VerificationFrench-language works237,207