{"id":"W2155938435","doi":"10.1016/j.scico.2006.01.009","title":"Describing data flow analysis techniques with Kleene algebra","year":2006,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"","keywords":"Soundness; Computer science; Control flow graph; Kleene algebra; Data-flow analysis; Data flow diagram; Control flow; Theoretical computer science; Program analysis; Kleene's recursion theorem; Compiler; Class (philosophy); Programming language; Graph; Static analysis; Algebra over a field; Flow (mathematics); Graph algebra; Algorithm; Discrete mathematics; Mathematics; Artificial intelligence; Database; 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":[],"consensus_categories":[],"category_scores_codex":[0.001270543,0.0002257098,0.0003385999,0.001035365,0.0003238146,0.0005063516,0.004138472,0.00005025958,0.000002612766],"category_scores_gemma":[0.00003186938,0.0001922923,0.00007636686,0.006871677,0.0006366683,0.003134107,0.001691101,0.0001581989,0.000001539437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007762033,"about_ca_system_score_gemma":0.000208206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001494845,"about_ca_topic_score_gemma":0.0000459913,"domain_scores_codex":[0.9969184,0.00004094698,0.0004326646,0.001102266,0.0009330713,0.0005726698],"domain_scores_gemma":[0.996886,0.0000585646,0.000307499,0.00216541,0.0004515419,0.0001309985],"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.000003621409,0.0001014852,0.0007591128,0.00001025221,0.000031347,0.0000113748,0.00006681449,0.001410763,0.002238075,0.006507854,0.00004329143,0.988816],"study_design_scores_gemma":[0.0001911861,0.0006210629,0.001099069,0.0001240405,0.00009415849,0.00006334556,0.00001893839,0.6607978,0.330037,0.003917416,0.002393269,0.0006427667],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004401837,0.00004773723,0.9935728,0.0001246564,0.00008828466,0.000316155,0.000002817356,0.001278508,0.000167177],"genre_scores_gemma":[0.3721098,0.000001589175,0.6277732,0.00002803759,0.00005134119,0.00001565893,0.000006406421,0.000007700462,0.000006291371],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9881732,"threshold_uncertainty_score":0.7841453,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02315846028272783,"score_gpt":0.2639729143379643,"score_spread":0.2408144540552365,"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."}}