{"id":"W1982369376","doi":"10.1016/j.jsc.2011.05.003","title":"Formal enforcement of security policies on concurrent systems","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais; Université Laval","funders":"","keywords":"Process calculus; Security policy; Modular design; Enforcement; Process (computing); Programming language; Computer science; Algebra over a field; Mathematics; Theoretical computer science; Computer security; Pure mathematics; Political science","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.000497444,0.0001041217,0.0002900029,0.0001635114,0.0000513813,0.00005448324,0.0003606775,0.0000392349,0.000005809219],"category_scores_gemma":[0.00001523668,0.00008348055,0.0001043051,0.0002005664,0.00002816933,0.0004979641,0.00005178699,0.0001155406,0.000004844256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005494718,"about_ca_system_score_gemma":0.00007160477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001141411,"about_ca_topic_score_gemma":0.000001330981,"domain_scores_codex":[0.9984944,0.0000671473,0.0007270824,0.00009450877,0.0004460125,0.0001708236],"domain_scores_gemma":[0.9984791,0.00004165363,0.0008574617,0.0001313829,0.0004060809,0.0000843322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000658449,0.0005462912,0.001249643,0.0002601969,0.000165605,0.00002716213,0.03478678,0.0209184,0.0001607108,0.8964748,0.003472946,0.04187158],"study_design_scores_gemma":[0.007907257,0.006458366,0.05346812,0.003475504,0.0001281587,0.001152175,0.006176276,0.8731518,0.007829632,0.02382259,0.01519277,0.001237311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3526515,0.000518209,0.6390222,0.00005147987,0.001652466,0.0001840435,0.00001140905,0.000022925,0.005885735],"genre_scores_gemma":[0.9992749,0.0000160304,0.0005619333,0.00003463548,0.00009687539,0.00000188914,0.000001653046,0.000003656729,0.000008397068],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8726522,"threshold_uncertainty_score":0.3404238,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03320849132871335,"score_gpt":0.2686917477429365,"score_spread":0.2354832564142231,"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."}}