{"id":"W4399913729","doi":"10.1016/j.eswa.2024.124557","title":"Basis path coverage testing of MPI programs based on multi-task evolutionary optimization","year":2024,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Task (project management); Path (computing); Basis (linear algebra); Machine learning; Artificial intelligence; Mathematics; Programming language","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.0002251712,0.0001612624,0.0001616445,0.0001746541,0.0001691306,0.0001645788,0.0004017754,0.00006494856,0.00000127158],"category_scores_gemma":[0.00008908877,0.0001307203,0.00004109837,0.001084939,0.00004852086,0.0001808627,0.00004769977,0.0001008307,0.00001145493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009624695,"about_ca_system_score_gemma":0.0001695062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002105048,"about_ca_topic_score_gemma":6.269559e-7,"domain_scores_codex":[0.9986776,0.00005958929,0.0002892792,0.0004713289,0.0003178697,0.0001843928],"domain_scores_gemma":[0.998404,0.0004529733,0.0001187209,0.0007188403,0.0002336832,0.00007177568],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002994053,0.002089254,0.01586314,0.00120537,0.0001256252,0.00004868984,0.002147728,0.670837,0.0008794435,0.03107418,0.02466766,0.251032],"study_design_scores_gemma":[0.000116889,0.0001485324,0.0001434109,0.0007801356,0.000005249135,0.0000218534,0.000008425222,0.9952458,0.00008112245,0.000156739,0.003128576,0.0001632768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004013705,0.0008031985,0.9900589,0.0001607235,0.00008601187,0.0009234331,0.00001145323,0.007400129,0.0005160363],"genre_scores_gemma":[0.4527418,0.000003721576,0.5452727,0.00004896045,0.00005307103,0.001799523,0.00002430199,0.00001827173,0.00003768576],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4527016,"threshold_uncertainty_score":0.5330618,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02840819779205341,"score_gpt":0.2692260970388619,"score_spread":0.2408178992468084,"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."}}