{"id":"W2154269166","doi":"10.1109/tc.2010.74","title":"Robust QBF Encodings for Sequential Circuits with Applications to Verification, Debug, and Test","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Very-large-scale integration; Encoding (memory); Satisfiability; Computability; Algorithm; Sequential logic; Theoretical computer science; True quantified Boolean formula; Computer engineering; Logic gate; Embedded system; Artificial intelligence","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.0003005367,0.0001796158,0.0001429363,0.000218031,0.0004105082,0.0002145263,0.0006198596,0.00008633821,0.000004398969],"category_scores_gemma":[0.00001566142,0.0001783507,0.00004821809,0.0005259128,0.00009210737,0.0004464276,0.000004340036,0.0002303189,0.00002357028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000465882,"about_ca_system_score_gemma":0.0000733396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001353192,"about_ca_topic_score_gemma":0.00002665436,"domain_scores_codex":[0.9987053,0.00002935549,0.0002362272,0.0005751036,0.000199211,0.0002548059],"domain_scores_gemma":[0.9984858,0.0003561964,0.00008626651,0.0006849802,0.0001948654,0.0001918683],"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.00004392268,0.0005489401,0.00008464091,0.00008358625,0.00007279938,0.000001653598,0.001669668,0.05896666,0.06729872,0.05003764,0.0006881975,0.8205036],"study_design_scores_gemma":[0.001851898,0.001261877,0.001814206,0.00008706018,0.00009390889,0.0002070167,0.00006020061,0.7568718,0.2043911,0.0009885285,0.03111355,0.001258896],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003459343,0.000003205667,0.9936746,0.0006887506,0.0007880555,0.0009895649,0.00002246085,0.0002859402,0.00008812325],"genre_scores_gemma":[0.3812484,0.000003464357,0.6178738,0.0002700725,0.0000606199,0.0004818891,0.000002242004,0.00001488333,0.0000446019],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8192447,"threshold_uncertainty_score":0.727293,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04050528070217042,"score_gpt":0.2750413686958254,"score_spread":0.2345360879936549,"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."}}