{"id":"W3000360140","doi":"10.4230/lipics.concur.2017.4","title":"A new notion of compositionality for concurrent program proofs","year":2017,"lang":"en","type":"article","venue":"International Conference on Concurrency Theory","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Principle of compositionality; Mathematical proof; Programming language; Computer science; Theoretical computer science; Mathematics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01069605,0.001500986,0.00146146,0.003564002,0.003096988,0.006991923,0.00424374,0.002538245,0.006139413],"category_scores_gemma":[0.02850893,0.002385188,0.004396073,0.002159355,0.009946397,0.02148747,0.01077524,0.0101912,0.001681905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001424367,"about_ca_system_score_gemma":0.002585131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006090292,"about_ca_topic_score_gemma":0.0007892554,"domain_scores_codex":[0.9828666,0.004531016,0.001866255,0.003352938,0.006272466,0.001110846],"domain_scores_gemma":[0.9691584,0.01442274,0.001512741,0.009381055,0.004211458,0.001313456],"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.0001145995,0.0000920882,0.0003204253,0.0002320727,0.00006286472,0.0001992312,0.0007768372,0.002680835,0.006461575,0.9623411,0.00116098,0.02555731],"study_design_scores_gemma":[0.00008173156,0.0001278489,0.0001537133,0.0001137575,0.0001796277,0.0004879663,0.0001446327,0.0284018,0.01316821,0.9328789,0.02417865,0.00008314716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005822988,0.000285898,0.98549,0.0006599959,0.0002785804,0.0001177876,0.00007137104,0.00085302,0.006420307],"genre_scores_gemma":[0.2231422,0.0005064794,0.7647692,0.001183964,0.001181083,0.0005386647,0.0003312947,0.001060838,0.007286226],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01069605,"threshold_uncertainty_score":0.05656683,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1351528161428429,"score_gpt":0.4384656416520773,"score_spread":0.3033128255092344,"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."}}