{"id":"W1487924811","doi":"10.1007/978-3-642-17796-5_2","title":"Verification of Common Interprocedural Compiler Optimizations Using Visibly Pushdown Kleene Algebra","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Programming language; Compiler; Kleene algebra; Recursion (computer science); Interprocedural optimization; Optimizing compiler; Compiler correctness; Loop optimization; Discrete mathematics; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006398077,0.0004610333,0.0006365054,0.0007892174,0.0002384442,0.0003347902,0.00296724,0.0003231167,0.00002982297],"category_scores_gemma":[0.00004192651,0.0004139928,0.0001551977,0.0007378703,0.0007273325,0.0006875133,0.0009394904,0.000485868,0.00002534074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002062596,"about_ca_system_score_gemma":0.0004439415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001546,"about_ca_topic_score_gemma":0.00006882013,"domain_scores_codex":[0.9968282,0.00005417643,0.000799915,0.001120759,0.0006898071,0.0005071721],"domain_scores_gemma":[0.9972222,0.0001564612,0.0006751614,0.001379538,0.0004212616,0.0001454053],"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.00001696834,0.0002082449,0.0007124898,0.0002187711,0.00006058093,0.00003815741,0.004171941,0.04218781,0.0007984059,0.5611079,0.00003462839,0.3904442],"study_design_scores_gemma":[0.000334845,0.0003106432,0.000288024,0.0002431606,0.00002712237,0.0001269209,7.743186e-7,0.7596862,0.003677475,0.2336637,0.0007860549,0.0008550841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001583096,0.0003777721,0.9935839,0.00009446179,0.001683523,0.0004729505,0.000003182347,0.0001432373,0.003482725],"genre_scores_gemma":[0.7911894,0.00002076108,0.2082118,0.0002325323,0.0001831595,0.00000703072,0.00001199851,0.00002869105,0.0001146559],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7910311,"threshold_uncertainty_score":0.9998312,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03073174728696838,"score_gpt":0.2576360042204539,"score_spread":0.2269042569334855,"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."}}