{"id":"W153103601","doi":"10.1007/978-3-642-39799-8_12","title":"Duet: Static Analysis for Unbounded Parallelism","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Concurrency; Computer science; Invariant (physics); Abstract interpretation; Modular design; Static analysis; Bounded function; Data flow diagram; Theoretical computer science; Programming language; Data-flow analysis; Parallelism (grammar); Parallel computing; Domain (mathematical analysis); Construct (python library); Algorithm; Mathematics; Database","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.0009007658,0.0005746875,0.000822917,0.001769176,0.0003536615,0.001032403,0.003646086,0.0003354816,0.00004358289],"category_scores_gemma":[0.0001138374,0.000529811,0.0003420243,0.001389066,0.0004338414,0.0005477219,0.0008652295,0.0004773097,0.00004611615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002588989,"about_ca_system_score_gemma":0.0004396974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003812496,"about_ca_topic_score_gemma":0.0000347774,"domain_scores_codex":[0.9960143,0.00004301948,0.0007125644,0.001682644,0.0007984003,0.0007490447],"domain_scores_gemma":[0.9964714,0.0007025963,0.0004563459,0.001649459,0.0005202232,0.0001999567],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005106335,0.00003956604,0.00004376752,0.00004931225,0.0001486183,0.00001664966,0.0007127041,0.6676703,0.00001386087,0.07222099,0.0003801469,0.2586989],"study_design_scores_gemma":[0.0001736653,0.0001058727,0.00005319819,0.00006928942,0.00003917956,0.000006840332,6.172134e-8,0.7626124,0.0001557142,0.2347323,0.00154293,0.0005086008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001915525,0.0002525091,0.9946199,0.0009383373,0.0006458174,0.0007626251,0.000007412585,0.0004942083,0.002260019],"genre_scores_gemma":[0.03337549,0.00005489977,0.9631895,0.001672463,0.0002027277,0.00005013957,0.00002267503,0.00003469427,0.001397439],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2581903,"threshold_uncertainty_score":0.9997153,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02135635818248072,"score_gpt":0.265792047061964,"score_spread":0.2444356888794833,"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."}}