{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007426974,0.000814877,0.0009125426,0.003020692,0.0003454725,0.0006349239,0.00350648,0.0003643518,0.00003826976],"category_scores_gemma":[0.0000912292,0.0007089954,0.0002389533,0.00307649,0.0008605812,0.00124368,0.001162905,0.001046992,0.0000137215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001046335,"about_ca_system_score_gemma":0.0008603342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006993554,"about_ca_topic_score_gemma":0.0001835084,"domain_scores_codex":[0.9947366,0.00004177367,0.0007031166,0.002270972,0.001370793,0.000876738],"domain_scores_gemma":[0.9961289,0.0002997665,0.0005415485,0.0022387,0.0004968675,0.0002942156],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001056243,0.00003691479,0.00004016962,0.00003840763,0.0001126391,0.0002672139,0.000514427,0.04696859,0.0003290356,0.02545754,0.000005260011,0.9262192],"study_design_scores_gemma":[0.0005416549,0.001540551,0.0001068649,0.001761667,0.0002841749,0.0003394736,7.671455e-7,0.158014,0.1314088,0.7010369,0.001547457,0.00341764],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004439571,0.0001926473,0.995881,0.0003935582,0.0002643373,0.0006558718,0.000006759837,0.001519459,0.001042013],"genre_scores_gemma":[0.09956007,0.00005697344,0.8987304,0.001306483,0.0001322049,0.00004036094,0.000006488137,0.00005883082,0.0001081682],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9228016,"threshold_uncertainty_score":0.9995361,"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."}}