{"id":"W3206946486","doi":"10.4230/lipics.disc.2021.29","title":"Detectable Sequential Specifications for Recoverable Shared Objects","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Correctness; Linearizability; Cache; Thread (computing); Shared memory; State (computer science); Parallel computing; Cache coherence; Sequential consistency; Atomicity; Distributed computing; Programming language; CPU cache; Consistency model; Cache algorithms","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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004776861,0.0003391412,0.0004761348,0.000134448,0.0005957697,0.001210425,0.001152476,0.0002119038,0.00005879655],"category_scores_gemma":[0.0001963645,0.0003422177,0.0003507978,0.0005689584,0.00004529312,0.002281087,0.0002939959,0.0002461939,0.0001588014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001794022,"about_ca_system_score_gemma":0.0002712336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001606016,"about_ca_topic_score_gemma":0.0000481986,"domain_scores_codex":[0.9971579,0.00002901582,0.001094525,0.0004468688,0.0004126938,0.0008589721],"domain_scores_gemma":[0.9971737,0.0001830442,0.0004131605,0.00118684,0.000816877,0.0002263691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000610447,0.003599049,0.003562637,0.007125876,0.001977403,0.0001031474,0.03741793,0.005604583,0.01518121,0.4126262,0.4052207,0.1069708],"study_design_scores_gemma":[0.004420276,0.0002183203,0.0002559197,0.0002396617,0.00004431523,0.0001521719,0.001006321,0.2277308,0.01856115,0.003220347,0.7432404,0.0009102745],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006613757,0.000167444,0.9777655,0.0005375107,0.002261416,0.001401733,0.002779793,0.0002934879,0.008179381],"genre_scores_gemma":[0.7359905,0.00007849935,0.2492723,0.001784676,0.0007293271,0.001294658,0.003971022,0.00009986635,0.006779138],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7293768,"threshold_uncertainty_score":0.999903,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04403339357712774,"score_gpt":0.2648344784635291,"score_spread":0.2208010848864014,"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."}}