{"id":"W4384471589","doi":"10.1007/978-3-031-37706-8_6","title":"Commutativity for Concurrent Program Termination Proofs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical proof; Commutative property; Computer science; Equivalence (formal languages); Bounded function; Programming language; Normalization property; Soundness; Concurrency; Theoretical computer science; Model checking; Algorithm; Discrete mathematics; Mathematics","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.0101065,0.0006722381,0.0009691553,0.001575546,0.001835877,0.003206113,0.001998099,0.001097995,0.005273209],"category_scores_gemma":[0.03335951,0.0009283008,0.00163064,0.001072917,0.005899259,0.00653441,0.004671767,0.003888501,0.001086068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002039786,"about_ca_system_score_gemma":0.002577065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002385951,"about_ca_topic_score_gemma":0.00175952,"domain_scores_codex":[0.9880593,0.004880392,0.0008674596,0.001370743,0.004119763,0.0007022507],"domain_scores_gemma":[0.9444585,0.04441123,0.001190062,0.005479585,0.003757316,0.0007032606],"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.0002458044,0.0001345667,0.001203988,0.0003580129,0.00005238471,0.0003994376,0.001375483,0.01495818,0.01072157,0.8633239,0.002956915,0.1042697],"study_design_scores_gemma":[0.0001112979,0.00009911789,0.0002263096,0.0001885187,0.00008466772,0.0002517892,0.000121999,0.1181774,0.02566629,0.8357748,0.01923241,0.00006527389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01260989,0.0003561534,0.9775519,0.0004492413,0.00009449742,0.0001132527,0.00004573433,0.001623641,0.007155633],"genre_scores_gemma":[0.4473619,0.0005642564,0.5442307,0.0006715616,0.0002062125,0.0003447992,0.0001747422,0.0007465618,0.005699369],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0101065,"threshold_uncertainty_score":0.05344892,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04280681412913767,"score_gpt":0.3076641941170086,"score_spread":0.264857379987871,"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."}}