{"id":"W1557455359","doi":"10.1007/978-3-540-27764-4_7","title":"Describing Gen/Kill Static Analysis Techniques with Kleene Algebra","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"","keywords":"Kleene algebra; Computer science; Control flow graph; Static analysis; Kleene's recursion theorem; Control flow; Compiler; Programming language; Program analysis; Theoretical computer science; Graph; Algebra over a field; Compile time; Call graph; Algorithm; Discrete mathematics; Mathematics; Pure 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.001223541,0.001480252,0.0008785035,0.002339495,0.001536825,0.00363267,0.002090107,0.001225685,0.01557319],"category_scores_gemma":[0.002720276,0.001468822,0.002266849,0.002484733,0.002102398,0.008334383,0.002343649,0.003484898,0.008607499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001020989,"about_ca_system_score_gemma":0.001087138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001158504,"about_ca_topic_score_gemma":0.002215356,"domain_scores_codex":[0.9985769,0.0002389098,0.0001103605,0.0002337612,0.0006544621,0.0001855707],"domain_scores_gemma":[0.9991172,0.0004361242,0.00005092033,0.0002525447,0.0001221277,0.00002108496],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001405516,0.0001333516,0.0005239346,0.0007935758,0.0000857536,0.0005951038,0.0008436806,0.01334051,0.01757187,0.6766238,0.01621801,0.2731299],"study_design_scores_gemma":[0.00003061545,0.00004797581,0.0002829769,0.00019842,0.0001070148,0.0007568107,0.0001814337,0.04537892,0.03357864,0.7891499,0.1301833,0.0001040405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003248037,0.0007166106,0.9635886,0.000247353,0.000125083,0.0001073895,0.0002308037,0.007300396,0.02443575],"genre_scores_gemma":[0.1473523,0.003025635,0.8023297,0.000628895,0.0002357696,0.0002588583,0.001526247,0.006582038,0.03806063],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01557319,"threshold_uncertainty_score":0.05209756,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01570392000073368,"score_gpt":0.2414441416934572,"score_spread":0.2257402216927235,"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."}}