{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001329984,0.000567648,0.0004884172,0.0008144247,0.000469138,0.0006136624,0.003678425,0.0002661222,0.00007985645],"category_scores_gemma":[0.0001398375,0.0005055976,0.00009866608,0.001354903,0.001275145,0.001300499,0.0008750032,0.001084005,0.00002246766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004841248,"about_ca_system_score_gemma":0.0006031108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000210445,"about_ca_topic_score_gemma":0.00002834154,"domain_scores_codex":[0.9954054,0.0001128065,0.0005963946,0.001816583,0.001396564,0.0006722888],"domain_scores_gemma":[0.9967226,0.0003141182,0.000502196,0.001983202,0.0003018274,0.0001760887],"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.00001974488,0.00006959324,0.00002631752,0.00003753273,0.0000153181,0.0000417709,0.0005437992,0.007587579,0.0002822967,0.1003371,0.00002132324,0.8910177],"study_design_scores_gemma":[0.0009959714,0.002430039,0.000813503,0.0004537387,0.00004176531,0.0004773021,0.00000180798,0.8207372,0.005183704,0.09471773,0.07180491,0.002342271],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001178048,0.00020023,0.9920104,0.0008482566,0.001159035,0.001124605,0.000008569246,0.000608629,0.003922453],"genre_scores_gemma":[0.02372438,0.00005118008,0.974112,0.001612135,0.0001906169,0.0001365633,0.00002644455,0.00004683779,0.00009985374],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8886754,"threshold_uncertainty_score":0.9997396,"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."}}