{"id":"W2287431757","doi":"10.1007/3-540-44520-x_50","title":"Identifying and Validating Irregular Mutual Exclusion Synchronization in Explicitly Parallel Programs","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Semaphore; Mutual exclusion; Computer science; Lock (firearm); Compiler; Deadlock; Synchronization (alternating current); Code (set theory); Parallel computing; Distributed computing; Programming language; Computer network","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.0009846902,0.000489077,0.0004871173,0.001035263,0.0003269415,0.0009148746,0.001774949,0.0003360274,0.0000101566],"category_scores_gemma":[0.00004829225,0.000494635,0.00007017452,0.0008521933,0.0003482517,0.0008313005,0.001305431,0.0006248996,0.00001091398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002640269,"about_ca_system_score_gemma":0.000236288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004185561,"about_ca_topic_score_gemma":0.00004477498,"domain_scores_codex":[0.9963115,0.00007457615,0.000670713,0.00154253,0.0007857554,0.0006149454],"domain_scores_gemma":[0.9984043,0.0001795488,0.0003017833,0.0008500837,0.0001333453,0.0001309675],"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.000003926913,0.0000281774,0.0001568962,0.00003810155,0.00000353021,0.00004965754,0.001416393,0.08671247,0.0000299206,0.005013107,0.000004818569,0.906543],"study_design_scores_gemma":[0.0002679569,0.0001061013,0.0001123031,0.0009163232,0.000003713148,0.00006137043,4.270202e-7,0.9135743,0.0002145904,0.08401884,0.0001756434,0.0005484428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006310171,0.000661471,0.9959802,0.0001904496,0.0003343552,0.0005354114,6.979876e-7,0.0004035927,0.001262825],"genre_scores_gemma":[0.2436146,0.0002621574,0.7554303,0.0003234566,0.0001734998,0.0000172274,0.0000156744,0.00003744415,0.0001255954],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9059945,"threshold_uncertainty_score":0.9997506,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02304014187286463,"score_gpt":0.2630176408308775,"score_spread":0.2399774989580129,"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."}}