{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003922825,0.00009226127,0.000113575,0.00005235497,0.00007877124,0.0001087505,0.0004674527,0.00004947004,0.00004588774],"category_scores_gemma":[0.0002301624,0.0000771836,0.00003499258,0.0001131027,0.00004328709,0.000414744,0.0001359185,0.00005238378,0.00003449101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002723264,"about_ca_system_score_gemma":0.000004693609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006795128,"about_ca_topic_score_gemma":3.155918e-7,"domain_scores_codex":[0.9992147,0.00005364166,0.0001493934,0.0003019607,0.0000965314,0.0001837925],"domain_scores_gemma":[0.999266,0.0001864324,0.00004693824,0.0004103237,0.00003675762,0.00005350256],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004343605,0.0001048309,0.000091438,0.00005565395,0.00002239122,2.86102e-7,0.0008710545,0.0001366204,0.0006450401,0.2606476,0.002180088,0.7352406],"study_design_scores_gemma":[0.0001170767,0.00005954246,0.0002040287,0.000006227175,0.000006982611,0.00001659966,0.0000187028,0.9711713,0.02179582,0.002069755,0.004371374,0.0001625606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006146256,0.0001590349,0.9786694,0.0003317583,0.00009751279,0.0002372,0.000001049744,0.0001617985,0.01972764],"genre_scores_gemma":[0.3655536,0.000009440111,0.6337596,0.00008948044,0.00001923429,0.000101905,1.437023e-7,0.000004910288,0.000461718],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9710347,"threshold_uncertainty_score":0.3147456,"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."}}