{"id":"W4230169210","doi":"10.1109/iccad.2003.159685","title":"Efficient generation of monitor circuits for GSTE assertion graphs","year":2003,"lang":"en","type":"article","venue":"ICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No.03CH37486)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Assertion; Formal verification; Scalability; Overhead (engineering); Automaton; Programming language; Abstraction; Theoretical computer science; Symbolic trajectory evaluation; Electronic circuit; Model checking; Computer engineering","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"],"consensus_categories":[],"category_scores_codex":[0.001767678,0.0005121022,0.0004971094,0.0006439002,0.000245874,0.0004035697,0.001798812,0.0002753827,0.0000468876],"category_scores_gemma":[0.001233023,0.000528267,0.0001792848,0.001143837,0.0001271967,0.000619907,0.00009567625,0.0002861475,0.0001392922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000355797,"about_ca_system_score_gemma":0.0006023715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001893627,"about_ca_topic_score_gemma":0.000001916917,"domain_scores_codex":[0.9953395,0.0006923155,0.001138351,0.001130917,0.001128576,0.0005704127],"domain_scores_gemma":[0.9922113,0.000349376,0.0007751903,0.00101464,0.005433619,0.0002158495],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008476972,0.0005623583,0.00009541689,0.00005980916,0.0001533452,0.000006818495,0.0005592383,0.0359987,0.1398053,0.7922793,0.004359057,0.0260359],"study_design_scores_gemma":[0.0007668494,0.0005736634,0.0004288723,0.0001502802,0.00002126456,0.00002100673,0.00001240941,0.8695616,0.124631,0.002659396,0.0006971607,0.0004765928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02329692,0.00001959401,0.9621215,0.0001498726,0.0113693,0.001365179,0.00003831084,0.0001997074,0.001439635],"genre_scores_gemma":[0.3507331,0.0000254309,0.6478676,0.0003330519,0.0004015824,0.0002537239,0.00003961444,0.00003613031,0.0003097493],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8335629,"threshold_uncertainty_score":0.9997169,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1474870650686887,"score_gpt":0.3351520262246679,"score_spread":0.1876649611559792,"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."}}