{"id":"W3005150256","doi":"10.1145/2775051.2677012","title":"Proof Spaces for Unbounded Parallelism","year":2015,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Computer science; Correctness; Separation logic; Mathematical proof; Soundness; Gas meter prover; Automated theorem proving; Abstract interpretation; Theoretical computer science; Programming language; Formal proof; TRACE (psycholinguistics); Hoare logic; Axiom; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.0005010422,0.0001431731,0.0001913173,0.00005698437,0.0001090134,0.0004583018,0.001384072,0.00008014646,0.00000360613],"category_scores_gemma":[0.0003723786,0.000108861,0.00005544976,0.000154935,0.00004547679,0.0004559987,0.0002289491,0.00006636161,0.0001041505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000243238,"about_ca_system_score_gemma":0.00009630942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000143656,"about_ca_topic_score_gemma":0.0001240945,"domain_scores_codex":[0.9988022,0.0000525488,0.0001900439,0.000349103,0.0002666154,0.0003394929],"domain_scores_gemma":[0.9986471,0.0002178608,0.0001417671,0.0007042145,0.000132064,0.0001569828],"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.00005170524,0.0001743963,0.005028197,0.0001613197,0.00009458394,0.00003820147,0.009314754,0.0002143891,0.0001057361,0.9145269,0.03194454,0.03834522],"study_design_scores_gemma":[0.001697338,0.0008165073,0.0005616351,0.0000112438,0.00003304694,0.00002799881,0.0007096259,0.01058231,0.001712118,0.3162208,0.6670128,0.000614534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03798268,0.002664949,0.9199027,0.008054277,0.005217681,0.002150692,0.000006431645,0.001022449,0.02299813],"genre_scores_gemma":[0.9701814,0.00000206331,0.02792936,0.0002185218,0.0003217025,0.00006731955,0.000008895843,0.000009955013,0.001260765],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9321988,"threshold_uncertainty_score":0.4439223,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07243827479088721,"score_gpt":0.2919481229640843,"score_spread":0.2195098481731971,"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."}}