{"id":"W2007666139","doi":"10.1007/s00165-012-0223-x","title":"Automatic verification of reduction techniques in Higher Order Logic","year":2012,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Computer science; Correctness; Soundness; Reduction (mathematics); Model checking; Programming language; Heuristics; Consistency (knowledge bases); Partial order reduction; Automated theorem proving; Algorithm; Formal verification; Reduction strategy; Theoretical computer science; Mathematics","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.001222375,0.000104014,0.000197514,0.0002312145,0.00004902623,0.00001525693,0.0004364057,0.00007478381,0.0000139861],"category_scores_gemma":[0.00008925379,0.0001004772,0.00003838892,0.0007724856,0.00005861381,0.001332873,0.0001532989,0.0001217471,0.000006076393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006677355,"about_ca_system_score_gemma":0.00003346576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002023516,"about_ca_topic_score_gemma":2.076312e-7,"domain_scores_codex":[0.9986967,0.0001018682,0.0005287052,0.0001486478,0.0002367623,0.0002872503],"domain_scores_gemma":[0.9989567,0.00004572309,0.0004425436,0.0003810331,0.0001377131,0.00003631707],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00000526655,0.0001584527,0.0006896038,0.000130124,0.000006590698,2.624515e-7,0.001513846,0.0002234497,0.01562811,0.8469974,0.00001018567,0.1346368],"study_design_scores_gemma":[0.0003333072,0.0002460005,0.2022688,0.000262007,0.00001098565,0.00005831056,0.0001689998,0.301035,0.4781452,0.01695396,0.0001700182,0.0003473323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3237268,0.00007145177,0.6663898,0.0000724856,0.0005258528,0.0002177211,2.962933e-7,0.0001782535,0.008817283],"genre_scores_gemma":[0.5483614,0.000001423377,0.4515688,0.000006468181,0.00004980106,0.000002975984,0.00000100364,0.000003840784,0.000004402549],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8300434,"threshold_uncertainty_score":0.4097341,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04194995695396473,"score_gpt":0.3097887354940638,"score_spread":0.2678387785400991,"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."}}