{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003078516,0.001105059,0.001384123,0.001215332,0.001474325,0.00308378,0.002773933,0.001614466,0.007303732],"category_scores_gemma":[0.009563422,0.001166977,0.003358945,0.0009377733,0.003433948,0.00661273,0.002867782,0.002678038,0.001414478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00164384,"about_ca_system_score_gemma":0.003247317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003033728,"about_ca_topic_score_gemma":0.003808597,"domain_scores_codex":[0.9946806,0.001180196,0.0003481715,0.0007360846,0.002134443,0.0009205244],"domain_scores_gemma":[0.9900057,0.00486455,0.000683734,0.003114853,0.001185754,0.0001455164],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00158145,0.0004039872,0.00331847,0.0007724924,0.0003235027,0.0008977324,0.0005310253,0.220319,0.09520302,0.5539327,0.005303734,0.1174128],"study_design_scores_gemma":[0.0001376427,0.0001898893,0.0006987532,0.00006997617,0.0001237721,0.000163477,0.0001358259,0.6011054,0.1291743,0.2641315,0.003975064,0.00009433618],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1133335,0.0002722655,0.8621473,0.0004167515,0.0002132093,0.0001769993,0.0004074233,0.01078351,0.01224899],"genre_scores_gemma":[0.8799948,0.0001717319,0.1143939,0.0001373888,0.00006763297,0.00009957049,0.0004951861,0.0010863,0.003553447],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007303732,"threshold_uncertainty_score":0.02443343,"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."}}