{"id":"W1976979256","doi":"10.1145/2259016.2259049","title":"Efficient bottom-up heap analysis for symbolic path-based data access summaries","year":2012,"lang":"en","type":"article","venue":"","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Heap (data structure); Computer science; Correctness; Java; Programming language; Program analysis; Data structure; Theoretical computer science; Block (permutation group theory); Symbolic execution; Static analysis; Algorithm; Mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.001044504,0.0001689511,0.0003097598,0.0001970161,0.0002117183,0.0005927328,0.002394982,0.00007458384,0.0000320075],"category_scores_gemma":[0.0000821159,0.0001226656,0.0001447313,0.000993801,0.00005236437,0.0004745712,0.0006901717,0.00007058227,0.00004958058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002992593,"about_ca_system_score_gemma":0.00008448918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004824255,"about_ca_topic_score_gemma":0.0001162634,"domain_scores_codex":[0.9982368,0.00007745373,0.0002906214,0.0005005815,0.0003210923,0.0005733925],"domain_scores_gemma":[0.9976412,0.0001949663,0.0001227373,0.001746205,0.0001073495,0.0001875395],"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.00002559234,0.0009220273,0.1772992,0.0001802232,0.0006937574,0.000004111846,0.001280048,0.001780584,0.00005800775,0.7658307,0.011567,0.0403587],"study_design_scores_gemma":[0.0005727652,0.00008263994,0.008295115,0.000002914081,0.000241318,0.000002401675,0.00007505278,0.9212551,0.000658396,0.0008482817,0.06752826,0.000437781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003534017,0.0003971116,0.9929164,0.0003336861,0.001043185,0.0003790448,0.0000155138,0.0002555525,0.001125474],"genre_scores_gemma":[0.9887386,0.000001689762,0.01000566,0.0003329864,0.0001997562,0.00005571751,0.0001222062,0.000008912415,0.0005344657],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9852046,"threshold_uncertainty_score":0.5715736,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08703489600512526,"score_gpt":0.3264010455523392,"score_spread":0.2393661495472139,"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."}}