{"id":"W2094437360","doi":"10.1016/j.scico.2013.11.005","title":"Infeasible paths in object-oriented programs","year":2013,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dataflow; Computer science; Reachability; Traverse; Control flow; Control flow graph; Graph; Program analysis; Reachability problem; Path (computing); Theoretical computer science; Algorithm; Context (archaeology); Call graph; Data-flow analysis; Data flow diagram; Parallel computing; Programming language","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.001823002,0.0001653154,0.0002209573,0.0005237903,0.0001394955,0.0004423872,0.001982942,0.00005639871,0.000004462537],"category_scores_gemma":[0.0001005607,0.0001506497,0.00005809085,0.003932462,0.0005559408,0.00293086,0.0006584554,0.0001775538,0.00003960518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009474449,"about_ca_system_score_gemma":0.0002311156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001545048,"about_ca_topic_score_gemma":0.000004837319,"domain_scores_codex":[0.9973747,0.00009000486,0.0005035176,0.0006058363,0.0007425982,0.0006833193],"domain_scores_gemma":[0.9983513,0.00004104578,0.0002290044,0.0008088883,0.0004125227,0.0001572228],"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.000001082378,0.0001533508,0.006285905,0.00002311428,0.000001786652,0.000001480704,0.001115966,0.00008958852,0.001428836,0.05833975,0.000008339082,0.9325508],"study_design_scores_gemma":[0.0006727044,0.0007953545,0.07621592,0.0002357401,0.000003119818,0.00003221686,0.0001869706,0.8913233,0.0198406,0.007811236,0.002310843,0.0005719298],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2330794,0.00002928105,0.764719,0.00009473348,0.0006162593,0.0007689451,8.767723e-8,0.0001881936,0.0005040705],"genre_scores_gemma":[0.4254184,0.000001277458,0.5744422,0.00002387756,0.00002331089,0.00007803036,5.137864e-7,0.000004368489,0.000008059772],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9319789,"threshold_uncertainty_score":0.6143315,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02225470980871377,"score_gpt":0.2856804653230817,"score_spread":0.263425755514368,"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."}}