{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001894086,0.002063651,0.001653467,0.002244866,0.001424864,0.002697156,0.003839969,0.001073389,0.02017151],"category_scores_gemma":[0.007037966,0.001478167,0.002509182,0.002521614,0.002175998,0.007933136,0.003348473,0.004405798,0.005382538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001609859,"about_ca_system_score_gemma":0.001951341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001771188,"about_ca_topic_score_gemma":0.002085816,"domain_scores_codex":[0.9973968,0.0005388611,0.0001803064,0.0004368529,0.001059078,0.000388206],"domain_scores_gemma":[0.9967318,0.001515724,0.0001387239,0.001039473,0.0004857244,0.0000885202],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004741756,0.0001389567,0.0009367178,0.00111911,0.0001406519,0.0002298005,0.0003499124,0.04723059,0.01149507,0.4842089,0.06108313,0.3925931],"study_design_scores_gemma":[0.00006471139,0.00006363667,0.0003770235,0.0002393613,0.0001127196,0.0001875686,0.00006444319,0.2024622,0.01583639,0.7250299,0.05548167,0.00008033542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005034877,0.001759718,0.9607776,0.0006240547,0.0006383611,0.0001019206,0.0007463624,0.01305727,0.01725966],"genre_scores_gemma":[0.2666372,0.003046752,0.6664773,0.001275842,0.001315309,0.0007054627,0.003879279,0.01411464,0.04254828],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02017151,"threshold_uncertainty_score":0.06748044,"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."}}