{"id":"W3185895498","doi":"10.1007/978-3-030-81685-8_39","title":"Counterexample-Guided Partial Bounding for Recursive Function Synthesis","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Recursion (computer science); Bounding overwatch; Counterexample; Computer science; μ operator; Function (biology); Primitive recursive function; Set (abstract data type); Recursive functions; Context (archaeology); Algorithm; Theoretical computer science; Mathematics; Discrete mathematics; Programming language","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.001263476,0.0007894397,0.0007262231,0.0008075983,0.0005270796,0.001302425,0.001083698,0.0007414698,0.003530456],"category_scores_gemma":[0.003107696,0.0003527169,0.000611979,0.0004934111,0.001682096,0.001424693,0.001500969,0.00117545,0.0006221934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008443865,"about_ca_system_score_gemma":0.0008337286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001002055,"about_ca_topic_score_gemma":0.001308588,"domain_scores_codex":[0.9988973,0.0003726677,0.00007284805,0.0001688336,0.0003501281,0.0001381797],"domain_scores_gemma":[0.9978771,0.001361036,0.000102927,0.0004534187,0.000164033,0.00004145477],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003705979,0.0001921897,0.00116877,0.0005828401,0.0000679173,0.0005825972,0.0006847571,0.1831318,0.1128911,0.4338715,0.004235533,0.2622204],"study_design_scores_gemma":[0.00003918587,0.0001450398,0.0001985026,0.000106719,0.00006291959,0.0003035852,0.00007613365,0.6793428,0.1644907,0.1335468,0.02164676,0.00004085534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0523068,0.0004035207,0.9343275,0.0001587257,0.0000529813,0.00006558854,0.00007036857,0.003155202,0.009459248],"genre_scores_gemma":[0.5937921,0.0003101084,0.399909,0.0001428103,0.00002352329,0.0001728018,0.0002415607,0.0008173755,0.004590833],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003530456,"threshold_uncertainty_score":0.01181048,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06086517328587813,"score_gpt":0.3070521637342828,"score_spread":0.2461869904484047,"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."}}