{"id":"W4290087445","doi":"10.1007/978-3-031-13185-1_2","title":"Program Verification with Constrained Horn Clauses (Invited Paper)","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Horn clause; Computer science; Satisfiability; Programming language; Boolean satisfiability problem; Satisfiability modulo theories; Fragment (logic); Formal verification; Solver; Type inference; Model checking; Automated theorem proving; Theoretical computer science; Software verification; Inference; Algorithm; Prolog; Artificial intelligence; Software","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.0008964442,0.0004100142,0.0002788869,0.0006133422,0.0002838173,0.001073885,0.0005528863,0.0005078152,0.01401124],"category_scores_gemma":[0.002103938,0.0002806891,0.0005210589,0.001127216,0.0006598711,0.001340494,0.0006890197,0.0009785701,0.00242426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007308348,"about_ca_system_score_gemma":0.0007924829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001806919,"about_ca_topic_score_gemma":0.001776505,"domain_scores_codex":[0.9995277,0.0001151705,0.00002323487,0.0001088982,0.0001848609,0.00004020763],"domain_scores_gemma":[0.999278,0.0004959399,0.0000229963,0.00005712488,0.0001224621,0.00002350142],"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.0001524876,0.00007635765,0.0004003378,0.0007673678,0.00004684913,0.0003588673,0.0003488579,0.01596717,0.01741336,0.4882926,0.07372406,0.4024517],"study_design_scores_gemma":[0.00008542524,0.00007594495,0.0006342779,0.0004205407,0.00005737909,0.0007155689,0.0001215041,0.08943427,0.0337534,0.4677232,0.4069352,0.00004329231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01111479,0.007337868,0.9183724,0.002520413,0.001367105,0.0001670453,0.0005294023,0.001934472,0.05665648],"genre_scores_gemma":[0.2566098,0.01155848,0.5971296,0.002410239,0.0008747161,0.000273073,0.002622862,0.001408343,0.127113],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01401124,"threshold_uncertainty_score":0.04687226,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02433652179233481,"score_gpt":0.2743427570465852,"score_spread":0.2500062352542504,"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."}}