{"id":"W2002702549","doi":"10.1017/s0960129513000054","title":"Verification of tree-processing programs via higher-order mode checking","year":2014,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Career Trek","funders":"","keywords":"Soundness; Computer science; Programmer; Tree (set theory); Recursion (computer science); Programming language; Data structure; Algorithm; 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.0008888525,0.0001671683,0.0002518887,0.0002068718,0.0001389935,0.0002687877,0.001797067,0.00005624943,0.000003061616],"category_scores_gemma":[0.0001998744,0.0001349268,0.00003761514,0.001350726,0.00046216,0.0004512143,0.0004511421,0.0001472027,0.00000265482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005303431,"about_ca_system_score_gemma":0.00006405175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001914399,"about_ca_topic_score_gemma":9.74606e-7,"domain_scores_codex":[0.9980049,0.000052897,0.0004079609,0.0005485225,0.0006132813,0.0003724015],"domain_scores_gemma":[0.9986246,0.0001847541,0.0001789147,0.0007455865,0.0001756211,0.00009052813],"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":[0.000001190853,0.00005111926,0.0009987433,0.00006733483,9.120143e-7,0.000001102937,0.0004857849,0.0004076306,0.000528964,0.06274278,0.00001559866,0.9346988],"study_design_scores_gemma":[0.00006250571,0.00003121008,0.003646879,0.00008153178,0.000001083019,0.00001224067,3.095892e-7,0.5607793,0.001470507,0.4338043,0.00001147859,0.00009868578],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01625559,0.00002075945,0.9815697,0.0001432291,0.0001767159,0.0001335752,1.08899e-7,0.001310572,0.0003897394],"genre_scores_gemma":[0.518228,1.65164e-7,0.4816722,0.00005757952,0.00002946072,0.000006502842,2.63176e-7,0.000004459939,0.000001382704],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9346002,"threshold_uncertainty_score":0.5502154,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02345760223450388,"score_gpt":0.2905000634481554,"score_spread":0.2670424612136515,"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."}}