{"id":"W2936369251","doi":"","title":"Interprocedural program analysis using visibly pushdown Kleene algebra","year":2011,"lang":"en","type":"article","venue":"Corpus Université Laval (Université Laval)","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Kleene algebra; Computer science; Programming language; Kleene's recursion theorem; Algebra over a field; Mathematics; Algorithm; Discrete mathematics; Pure mathematics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003778294,0.0004669538,0.0005709259,0.001339143,0.0009001899,0.0001940378,0.00232667,0.0002252762,0.00004452114],"category_scores_gemma":[0.00003215539,0.0005185002,0.0005922588,0.003658469,0.0001488853,0.001325519,0.001097408,0.0006223901,0.00003448069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005274733,"about_ca_system_score_gemma":0.0002503037,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01043557,"about_ca_topic_score_gemma":0.00184282,"domain_scores_codex":[0.9970146,0.0002429733,0.0003079133,0.001041909,0.00053537,0.0008571664],"domain_scores_gemma":[0.9978629,0.00007398434,0.0003761561,0.0009916347,0.0002458921,0.0004494795],"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.0002367972,0.0008010882,0.1524746,0.0000694076,0.002101498,0.001539421,0.08285988,0.0007087578,0.003856465,0.03602317,0.000164793,0.7191641],"study_design_scores_gemma":[0.01177433,0.006614634,0.2858772,0.0008119986,0.01209018,0.001406508,0.02955364,0.3666291,0.04482559,0.001877839,0.2281288,0.01041016],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8169754,0.0004735395,0.1742454,0.0003324403,0.0004930919,0.0004476153,0.000007986686,0.002222898,0.004801673],"genre_scores_gemma":[0.9167609,0.00007150291,0.08071274,0.00008264674,0.00005435833,0.000001653294,0.00001622092,0.00003696053,0.002263011],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7087539,"threshold_uncertainty_score":0.9997267,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01611354861625271,"score_gpt":0.2164032634666811,"score_spread":0.2002897148504284,"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."}}