{"id":"W4235108696","doi":"10.1109/ishls.1994.302332","title":"A divide-and-conquer approach for asynchronous interface synthesis","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Chengdu University of Information Technology","keywords":"Asynchronous communication; Computer science; Divide and conquer algorithms; Interface (matter); High-level synthesis; Graph; Theoretical computer science; Digital electronics; Computer engineering; Computer architecture; Distributed computing; Parallel computing; Electronic circuit; Algorithm; Embedded system; Computer network","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.0005311273,0.0007505289,0.0005277474,0.0009158991,0.0006267306,0.0008828881,0.00100522,0.0006007296,0.004569359],"category_scores_gemma":[0.001326351,0.000420657,0.0006156981,0.0009232088,0.0007922963,0.001021656,0.0006418864,0.0009664564,0.0006667379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000838837,"about_ca_system_score_gemma":0.001211738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002155897,"about_ca_topic_score_gemma":0.003792209,"domain_scores_codex":[0.9994183,0.0001389933,0.00005116659,0.0001169097,0.000212905,0.00006182832],"domain_scores_gemma":[0.9995072,0.0002364312,0.00004615738,0.00007197133,0.0001215931,0.00001671526],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002484818,0.000205682,0.0004701516,0.0003918763,0.00007633508,0.0001964444,0.0002099304,0.1938704,0.0644136,0.09247833,0.005495964,0.6419428],"study_design_scores_gemma":[0.000136051,0.0002181172,0.0001202765,0.00003315837,0.0000546394,0.0002110563,0.00004762676,0.8958158,0.04920078,0.03951626,0.01461568,0.00003053684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00323389,0.0001026955,0.9942417,0.00008751838,0.0000161151,0.00006311731,0.00002685296,0.0005164347,0.001711652],"genre_scores_gemma":[0.05062035,0.0001410222,0.9469616,0.0000970976,0.00002046823,0.0001633552,0.0001086204,0.00009854957,0.001789083],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004569359,"threshold_uncertainty_score":0.01528603,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05022010518522898,"score_gpt":0.2773994245491495,"score_spread":0.2271793193639205,"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."}}