MétaCan
Menu
Back to cohort
Record W2043769126 · doi:10.1109/mwscas.2013.6674839

SAT-based reversible gate/wire replacement fault testing

2013· article· en· W2043769126 on OpenAlexaff
Sayeeda Sultana, Atena Roshan Fekr, Katarzyna Radecka

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicVLSI and Analog Circuit Testing
Canadian institutionsMcGill University
Fundersnot available
KeywordsBacktrackingComputer scienceSet (abstract data type)Boolean satisfiability problemAutomatic test pattern generationSatisfiabilityFault coverageProcess (computing)Logic gateFault (geology)AlgorithmMatching (statistics)Test setReliability engineeringEngineeringElectronic circuitMathematicsElectrical engineeringArtificial intelligenceProgramming language

Abstract

fetched live from OpenAlex

Recently reversible circuit testing has become an important issue for researchers. In the process of design, synthesis or template matching, failures can happen due to erroneous replacements or incorrect cascading of gates. In this paper, we present testing such errors modeled as gate and wire replacement faults, which can also handle most frequently addressed errors like missing gate and control points appearance or disappearance. Here, we propose three testing schemes based on Boolean Satisfiability (SAT) formulation and compare their efficiencies. In particular, we present the design of a Reversible Test Miter, which, along with backtracking, can easily detect such faults. We show that a smaller test set can be derived from the reversible test miter, increasing fault coverage and speed of testing.

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 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 categoriesInsufficient payload (model declined to judge)
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.974
Threshold uncertainty score1.000

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.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.032
GPT teacher head0.230
Teacher spread0.198 · 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 teacher head, not a consensus.

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

Citations1
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicVLSI and Analog Circuit TestingFrench-language works237,207