{"id":"W2160243077","doi":"10.1016/j.entcs.2011.11.017","title":"Proving Reachability in B using Substitution Refinement","year":2011,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Reachability; Substitution (logic); Computer science; Statement (logic); State (computer science); Construct (python library); Property (philosophy); Programming language; Scheme (mathematics); Theoretical computer science; Mathematics; Law","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.00348745,0.001001522,0.000644086,0.001548925,0.001089383,0.001346115,0.00135651,0.0009754527,0.001917923],"category_scores_gemma":[0.007673561,0.001042645,0.00251369,0.0008907871,0.003405683,0.003252286,0.003324293,0.002717584,0.000682105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001320203,"about_ca_system_score_gemma":0.00219805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01281541,"about_ca_topic_score_gemma":0.009511361,"domain_scores_codex":[0.9963659,0.001293987,0.0002785177,0.0005457668,0.001076278,0.0004395178],"domain_scores_gemma":[0.9939175,0.004184088,0.0002794079,0.0007866332,0.0006948412,0.000137565],"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.0004702818,0.0003285504,0.003339818,0.0005227165,0.0002197804,0.001612431,0.001606256,0.07926138,0.09151667,0.7406913,0.001795796,0.07863514],"study_design_scores_gemma":[0.0002127152,0.0003631238,0.0009817288,0.0001054621,0.0001875571,0.0003554679,0.0002849012,0.3547706,0.09345008,0.5380118,0.01116942,0.0001071375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0283294,0.00006341807,0.9680437,0.000232313,0.00002291883,0.00009099783,0.00006162373,0.0008940158,0.002261618],"genre_scores_gemma":[0.4185867,0.0003546845,0.5772649,0.0004808418,0.0000350998,0.0002350744,0.0003419126,0.0002689715,0.002431823],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01281541,"threshold_uncertainty_score":0.02548164,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03090794954398939,"score_gpt":0.2734806031087783,"score_spread":0.2425726535647889,"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."}}