{"id":"W2093549400","doi":"10.1007/bfb0105123","title":"A methodology for programming with concurrency","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Concurrency; Computer science; Correctness; Programming language; Mathematical proof; Deadlock; Concurrent object-oriented programming; Theoretical computer science; Programming paradigm; Mathematics; Procedural programming; Inductive programming","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.002845892,0.0005811388,0.000755631,0.0007674671,0.0002893543,0.0005206958,0.00286822,0.0004332584,0.000006175191],"category_scores_gemma":[0.0001539456,0.0004400453,0.0001639239,0.0006405138,0.0008690218,0.0003831068,0.000619868,0.000648375,0.00001783477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002016382,"about_ca_system_score_gemma":0.0006414342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003894228,"about_ca_topic_score_gemma":0.0002160927,"domain_scores_codex":[0.995762,0.00005976413,0.0005834345,0.001752593,0.0007692019,0.001073038],"domain_scores_gemma":[0.9965188,0.001196137,0.000448925,0.001166949,0.0004576535,0.000211529],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009152672,0.00001780166,0.00003620746,0.00006500414,0.00001422879,0.00005129306,0.0005681446,0.0002853922,0.000009473209,0.266499,0.000006494566,0.7324378],"study_design_scores_gemma":[0.00171643,0.003197308,0.00005138253,0.0002951298,0.00005638252,0.0007972186,0.000001691218,0.07588976,0.001505282,0.7188558,0.1951306,0.00250301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000003957713,0.0008224646,0.9925476,0.0001995355,0.002248068,0.001283857,0.000001346733,0.0002649128,0.002628305],"genre_scores_gemma":[0.03070878,0.00001032697,0.9674917,0.0005534636,0.0006606315,0.00006095632,0.000006331202,0.00004078959,0.0004669958],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7299348,"threshold_uncertainty_score":0.9998052,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08823775316025535,"score_gpt":0.3238388774395125,"score_spread":0.2356011242792572,"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."}}