MétaCan
Menu
Back to cohort
Record W2100494504 · doi:10.1142/s0218126615500206

ICAT: Engine to Perform Range Analysis and Allocate Bit-Widths for Arithmetic Datapaths

2014· article· en· W2100494504 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

VenueJournal of Circuits Systems and Computers · 2014
Typearticle
Languageen
FieldComputer Science
TopicNumerical Methods and Algorithms
Canadian institutionsMcGill University
Fundersnot available
KeywordsAffine arithmeticArithmeticSaturation arithmeticComputer scienceRange (aeronautics)Register allocationInterval arithmeticArbitrary-precision arithmeticInteger (computer science)Fixed-point arithmeticAlgorithmFloating pointAffine transformationMathematicsCompiler

Abstract

fetched live from OpenAlex

Range analysis determines allocation of fixed-point integer bit-widths, which is critical for arithmetic on fixed-point representations. The traditional methods, either simulation-based or static, can be time-consuming and produce coarse bounds, potentially leading to large error bounds and unnecessary bits. In this paper, we propose a new static method to perform fixed-point range analysis towards obtaining the tighter ranges efficiently. The hybrid method, ICAT, combines four techniques, including Interval arithmetic, consistency checking, affine arithmetic and arithmetic transform and is the only method that is aware how far it is from the exact solution. For the benchmarks available with comparable methods, we show that the bit-width allocation can be obtained with better results, and in shorter execution time.

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.002
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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.990
Threshold uncertainty score0.538

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
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.015
GPT teacher head0.254
Teacher spread0.239 · 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