{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002765291,0.00008692386,0.0002969243,0.0003982219,0.00007365255,0.00002340749,0.0007234286,0.00006229289,0.00002775112],"category_scores_gemma":[0.0001299568,0.00006876467,0.0001628098,0.0009603113,0.00008923694,0.0006111819,0.0001104089,0.0001723188,0.000001191543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008547391,"about_ca_system_score_gemma":0.00009844821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000035145,"about_ca_topic_score_gemma":2.29497e-7,"domain_scores_codex":[0.9985691,0.00007856643,0.0006472568,0.0001386067,0.0004072695,0.0001591999],"domain_scores_gemma":[0.9981744,0.00009345081,0.001005683,0.0003173121,0.000354061,0.0000550809],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002182953,0.0002152692,0.001508801,0.00002233703,0.000175815,0.000002450285,0.001572433,0.006087349,0.005472072,0.9590759,0.000002998194,0.02584277],"study_design_scores_gemma":[0.0007362804,0.0003972885,0.2088252,0.00002688329,0.0005579912,0.00005455716,0.0002866391,0.4385123,0.03151024,0.3187605,0.00003420964,0.0002978613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2491165,0.00001169217,0.7438259,0.000009850392,0.0001230823,0.00007328233,7.292389e-7,0.00001033752,0.006828569],"genre_scores_gemma":[0.6298565,0.000001556278,0.3700962,0.00002784885,0.00001338786,8.689581e-7,2.884968e-7,0.000002177108,0.000001221683],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6403154,"threshold_uncertainty_score":0.2804142,"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."}}