MétaCan
Menu
Back to cohort
Record W2146816098 · doi:10.1109/test.1990.114032

Testability preserving transformations in multi-level logic synthesis

2002· article· en· W2146816098 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
TopicVLSI and Analog Circuit Testing
Canadian institutionsMcGill University
Fundersnot available
KeywordsCube (algebra)TestabilitySimple (philosophy)FactorizationSet (abstract data type)Computer scienceAlgebraic expressionSimplicityRepresentation (politics)DecompositionMathematicsAlgorithmTheoretical computer scienceDuality (order theory)Algebraic numberDiscrete mathematicsAlgebra over a fieldCombinatoricsPure mathematicsProgramming language

Abstract

fetched live from OpenAlex

The authors present a very efficient new method for the decomposition and factorization of Boolean expressions, which produces irredundant multilevel networks. The method is based on very simple objects, namely, double-cube divisors and single-cube divisors with only two laterals. It is demonstrated that these objects, despite their simplicity, provide a very good framework for reasoning about common algebraic divisors and duality relations between expressions. Since both the time and space complexity of the operations on double-cube and single-cube divisors is polynomial in the size of the two-level representation, the algorithms run much faster than those based on kernels. It is shown both theoretically and experimentally that the decomposition and factorization transformations introduced preserve testability, which implies that a complete test set developed for an input network also gives complete coverage of faults in the synthesized multi-level network.< <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: none
Teacher disagreement score0.955
Threshold uncertainty score0.284

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.195
GPT teacher head0.276
Teacher spread0.081 · 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

Citations42
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicVLSI and Analog Circuit TestingFrench-language works237,207