{"id":"W2533585991","doi":"10.1109/icm-02.2002.1161537","title":"A high-level data path allocation algorithm based on BIST testability metrics","year":2004,"lang":"en","type":"article","venue":"","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria; St. Francis Xavier University","funders":"","keywords":"Testability; Computer science; Metric (unit); Path (computing); Built-in self-test; Design for testing; High-level synthesis; Algorithm; Test data; Register allocation; Reliability engineering; Engineering; Embedded system; Field-programmable gate array","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007778881,0.0001282919,0.0001258376,0.0001449538,0.000141498,0.000164216,0.001402232,0.00004682437,0.00001240707],"category_scores_gemma":[0.0007274339,0.000109184,0.00002783329,0.001176023,0.000029913,0.0004928776,0.0002412748,0.0001221524,0.00005657909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001080759,"about_ca_system_score_gemma":0.0002379092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007928189,"about_ca_topic_score_gemma":0.00004938273,"domain_scores_codex":[0.9984823,0.00004556334,0.0002192334,0.0006142762,0.000395881,0.0002427179],"domain_scores_gemma":[0.9978228,0.0002612869,0.00007131891,0.001596327,0.0001466356,0.0001016197],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[1.007386e-7,0.0002499904,0.0005947321,0.00001054243,0.000003283743,0.000009906176,0.00002329977,0.0009973675,0.00009345877,0.0106781,0.0001366728,0.9872025],"study_design_scores_gemma":[0.0005105233,0.0001100858,0.01338753,0.00002476497,0.000005864445,0.000003538225,0.000009299853,0.9813022,0.0008572729,0.003300749,0.0002669824,0.0002212135],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006662738,0.00001508511,0.9961947,0.0008835719,0.0001759062,0.0001119915,0.00003336341,0.0002943859,0.00162473],"genre_scores_gemma":[0.6594579,0.000001834184,0.3397238,0.0006775326,0.00005261802,0.00000372778,0.00005481743,0.00000556754,0.00002221513],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9869813,"threshold_uncertainty_score":0.4452396,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08724448348443713,"score_gpt":0.2741399158972033,"score_spread":0.1868954324127661,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}