{"id":"W1582180905","doi":"10.1007/978-3-642-15769-1_16","title":"Compositional Bitvector Analysis for Concurrent Programs with Nested Locks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Reachability; Synchronization (alternating current); Parallel computing; Algorithm; Concurrent data structure; Concurrency; Nested loop join; Data-flow analysis; Data flow diagram; Theoretical computer science; Distributed computing; 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.001403101,0.0008058513,0.0008383272,0.001552717,0.0009012114,0.002268238,0.002007158,0.0007727304,0.005564061],"category_scores_gemma":[0.005411245,0.000660118,0.001489349,0.001669955,0.002131576,0.005218115,0.00272497,0.001910151,0.001038442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001133393,"about_ca_system_score_gemma":0.001432631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001685813,"about_ca_topic_score_gemma":0.002456858,"domain_scores_codex":[0.9980312,0.0003771091,0.0001294915,0.0002230046,0.0009458107,0.0002934243],"domain_scores_gemma":[0.9973604,0.001233727,0.0001875832,0.0006194667,0.0005146409,0.00008407911],"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.0002705458,0.00008387338,0.001066857,0.000248483,0.00004495614,0.0001498592,0.0004926791,0.03006192,0.01546619,0.8532138,0.002050479,0.09685034],"study_design_scores_gemma":[0.00002826342,0.0000382488,0.0002040326,0.0000457615,0.00005086392,0.0000878296,0.0000962393,0.2467025,0.01426678,0.733443,0.005002653,0.00003378852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01660145,0.0001409999,0.9788392,0.00009496013,0.00004180847,0.00004823543,0.00006587464,0.001048181,0.003119282],"genre_scores_gemma":[0.4859473,0.0004030205,0.5009245,0.0002150548,0.0001409173,0.0002250927,0.0004938749,0.001391416,0.0102587],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005564061,"threshold_uncertainty_score":0.01861364,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01581229568051444,"score_gpt":0.2467588432121455,"score_spread":0.2309465475316311,"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."}}