{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005785721,0.0006043622,0.0008607237,0.0007963659,0.00036207,0.0009341606,0.002682068,0.0003684037,0.00001235507],"category_scores_gemma":[0.00001955089,0.0004780364,0.0002990132,0.001492677,0.0007770343,0.000420943,0.0004120379,0.0007661082,0.00001126725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001816256,"about_ca_system_score_gemma":0.0005707595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002806144,"about_ca_topic_score_gemma":0.0004065423,"domain_scores_codex":[0.9958059,0.00002458147,0.0005995308,0.001731834,0.001109297,0.0007288156],"domain_scores_gemma":[0.9970276,0.0003079819,0.0004498908,0.001231424,0.000725014,0.0002580317],"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.00004087395,0.000272404,0.001065361,0.0001797873,0.0004497597,0.0001233156,0.0006829785,0.03051325,0.000835892,0.05153018,0.00003804598,0.9142681],"study_design_scores_gemma":[0.001639661,0.001160397,0.00129128,0.0009020429,0.0002434988,0.0001985162,3.375012e-7,0.948125,0.002574446,0.01859456,0.02301939,0.002250868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003346945,0.0002080534,0.995869,0.0004642963,0.001537596,0.001011783,0.00007809322,0.000183116,0.0003133408],"genre_scores_gemma":[0.5188205,0.00000511112,0.4793203,0.0005419382,0.0006261933,0.0001223843,0.0002383322,0.0000424169,0.000282823],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9176117,"threshold_uncertainty_score":0.9997671,"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."}}