MétaCan
Menu
Back to cohort
Record W2051988259 · doi:10.1016/s1571-0661(04)80669-8

Improving Termination of MDG-Based Abstract State Enumeration via Term Schematization

2001· article· en· W2051988259 on OpenAlexaff
Sophie Renault, E. Cerny

Bibliographic record

VenueElectronic Notes in Theoretical Computer Science · 2001
Typearticle
Languageen
FieldComputer Science
TopicFormal Methods in Verification
Canadian institutionsUniversité de Montréal
Fundersnot available
KeywordsEnumerationExploitTerm (time)Computer scienceState (computer science)Theoretical computer scienceAlgorithmMathematicsDiscrete mathematics

Abstract

fetched live from OpenAlex

The MDG approach for hardware verification was recently proposed to overcome some limitations of traditional ROBDD-based methods of automated verification. One of its weakness, however, is that it may suffer from the non termination of the state enumeration procedure. In this paper, we exploit an idea recently proposed of using term schematization to address this problem. We propose a strategy to direct the introduction of schematized terms in the state enumeration procedure. We show that for certain cases of non termination, it significantly improves over the previously known approaches.

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.005
metaresearch head score (Gemma)0.015
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.005
Threshold uncertainty score0.026

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.015
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.003
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0020.001

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.008
GPT teacher head0.274
Teacher spread0.266 · 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 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

Citations0
Published2001
Admission routes1
Has abstractyes

Explore more

Same venueElectronic Notes in Theoretical Computer ScienceSame topicFormal Methods in VerificationFrench-language works237,207