{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004251047,0.0007552483,0.0009227172,0.001991842,0.00252593,0.003429994,0.001460035,0.002215548,0.004393976],"category_scores_gemma":[0.03500198,0.001615677,0.001150805,0.002113853,0.004939992,0.007270311,0.003747375,0.004033217,0.0004107324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001651408,"about_ca_system_score_gemma":0.002645313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00464487,"about_ca_topic_score_gemma":0.004865397,"domain_scores_codex":[0.9945919,0.001935135,0.0003587819,0.0005451696,0.001947343,0.0006216613],"domain_scores_gemma":[0.9595531,0.03471218,0.002478477,0.001417465,0.001351713,0.0004870559],"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.0004187055,0.0001436782,0.003816617,0.000394087,0.00005261556,0.001065225,0.00139526,0.1013316,0.00213181,0.8597063,0.001432364,0.02811179],"study_design_scores_gemma":[0.00004658603,0.00002802658,0.0002988277,0.00006240264,0.00003641417,0.0001398016,0.0001795862,0.0828622,0.001718829,0.9123253,0.002282075,0.00002009816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1821312,0.0004459186,0.803498,0.001136024,0.00007102918,0.0001675537,0.0002664624,0.0007370176,0.01154684],"genre_scores_gemma":[0.7652062,0.0006473304,0.2259453,0.0002790223,0.0000519477,0.0003078949,0.0005673877,0.0004167327,0.006578257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00464487,"threshold_uncertainty_score":0.02248198,"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."}}