{"id":"W4307886450","doi":"10.1145/3563298","title":"Proving hypersafety compositionally","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"European Research Council; European Commission","keywords":"Mathematical proof; Arity; Principle of compositionality; Idempotence; Construct (python library); Structural proof theory; Class (philosophy); Associative property; Computer science; Mathematics; Block (permutation group theory); Algebra over a field; Negation; Theoretical computer science; Programming language; Discrete mathematics; Pure mathematics; Proof theory; Combinatorics; Artificial intelligence","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.0007831171,0.0001696464,0.0002015984,0.0001032252,0.0005718732,0.0001870722,0.004123056,0.00003761377,0.00001355424],"category_scores_gemma":[0.0003248386,0.0001224683,0.0001588914,0.0005721234,0.00007825274,0.0002298234,0.002686954,0.0002985533,0.000006905469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008658621,"about_ca_system_score_gemma":0.00004545672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000493914,"about_ca_topic_score_gemma":0.000001424104,"domain_scores_codex":[0.9982151,0.00002962335,0.0002776323,0.0004121745,0.0007184086,0.0003470093],"domain_scores_gemma":[0.9987768,0.00008570927,0.0003267909,0.0006129806,0.0001408582,0.00005686871],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004200486,0.0004674833,0.009706269,0.0002030644,0.00009193415,0.000008877676,0.005606162,0.00004409901,0.01150943,0.8233927,0.002214888,0.1467131],"study_design_scores_gemma":[0.005067622,0.006001428,0.02557335,0.0002380757,0.0002542801,0.001448817,0.02977561,0.003713657,0.1242034,0.1945599,0.605546,0.003617791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8713011,0.003322394,0.008187111,0.03372099,0.003854848,0.006743348,0.00002337152,0.0036574,0.06918941],"genre_scores_gemma":[0.9807969,0.000001631484,0.01802943,0.0003066456,0.00008723418,0.0001680761,0.000002247838,0.00001711156,0.0005907082],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6288328,"threshold_uncertainty_score":0.7661732,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01487824833160079,"score_gpt":0.2438954345114393,"score_spread":0.2290171861798385,"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."}}