{"id":"W2115026027","doi":"10.1016/j.jal.2011.01.002","title":"Formal reliability analysis of combinational circuits using theorem proving","year":2011,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinational logic; Automated theorem proving; Computer science; HOL; Reliability (semiconductor); Reliability engineering; Boolean circuit; Benchmark (surveying); Sequential logic; Algorithm; Logic gate; Theoretical computer science; Computer engineering; Programming language; Engineering","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005898197,0.0009752468,0.0009227928,0.002199233,0.0006817323,0.001743671,0.002143065,0.0008806508,0.004156487],"category_scores_gemma":[0.02689987,0.0008243038,0.002478943,0.0009160558,0.002342159,0.003835538,0.001205004,0.001989793,0.0004705675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00125493,"about_ca_system_score_gemma":0.001557047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00114869,"about_ca_topic_score_gemma":0.001044264,"domain_scores_codex":[0.9940398,0.002199818,0.0003269713,0.0006423626,0.002258545,0.0005325399],"domain_scores_gemma":[0.9627697,0.02917303,0.001706063,0.003801984,0.002388373,0.0001607907],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004078451,0.0002717861,0.002618123,0.0009654877,0.0003073893,0.0005244222,0.0004839695,0.4522616,0.02841212,0.3927985,0.00212479,0.1188242],"study_design_scores_gemma":[0.00005558654,0.00009271694,0.0003246541,0.00005828409,0.0001173294,0.000169163,0.00003624243,0.7999687,0.01695366,0.1807431,0.001449452,0.00003116273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02303201,0.0001733083,0.9740036,0.0001224134,0.00003013963,0.00008124827,0.00006117858,0.0007909486,0.001705152],"genre_scores_gemma":[0.7354723,0.0003738845,0.2620769,0.00008704636,0.00009395677,0.000188215,0.0001863308,0.0003292728,0.001192054],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005898197,"threshold_uncertainty_score":0.03119302,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07512871240220503,"score_gpt":0.2943637603353065,"score_spread":0.2192350479331015,"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."}}