MétaCan
Menu
Back to cohort
Record W1519061151

Oscillator verification with probability one

2012· article· en· W1519061151 on OpenAlexaff
Chao Yan, Mark R. Greenstreet

Bibliographic record

VenueFormal Methods in Computer-Aided Design · 2012
Typearticle
Languageen
FieldComputer Science
TopicNumerical Methods and Algorithms
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsSoundnessGeneralizationComputer scienceDifferential (mechanical device)Formal verificationRing oscillatorRuntime verificationTask (project management)Ring (chemistry)Control theory (sociology)Theoretical computer scienceAlgorithmElectronic engineeringMathematicsEngineeringProgramming languageArtificial intelligence
DOInot available

Abstract

fetched live from OpenAlex

This paper presents the formal verification of startup for a differential ring-oscillator circuit used in industrial designs. Dynamical systems theory shows that any oscillator must have a non-empty failure; however, it is possible to show that these failures only occur with zero probability. To do so, this paper generalizes the “cone argument” initially presented in [1] and proves the soundness of this generalization. This paper also shows how concepts from analog design such as differential operation can be soundly incorporated into the verification to produce simpler models and reduce the complexity of the verification task.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.008
metaresearch head score (Gemma)0.045
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.008
Threshold uncertainty score0.040

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0080.045
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.003
Bibliometrics0.0010.001
Science and technology studies0.0010.006
Scholarly communication0.0030.006
Open science0.0020.005
Research integrity0.0010.005
Insufficient payload (model declined to judge)0.0070.002

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.111
GPT teacher head0.357
Teacher spread0.246 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Citations8
Published2012
Admission routes1
Has abstractyes

Explore more

Same venueFormal Methods in Computer-Aided DesignSame topicNumerical Methods and AlgorithmsFrench-language works237,207