{"id":"W1480815731","doi":"10.1007/978-3-540-30494-4_8","title":"Combining Equivalence Verification and Completion Functions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Modular design; Sobel operator; Formal equivalence checking; Computer engineering; Equivalence (formal languages); Functional verification; Implementation; Formal verification; Algorithm; Programming language; Theoretical computer science; Artificial intelligence; Edge detection","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.00132709,0.000407665,0.0003814288,0.0006102858,0.0007604157,0.0009664571,0.001812144,0.0002796064,0.00001368802],"category_scores_gemma":[0.0001641434,0.0004226153,0.00006740826,0.0006248414,0.0009169339,0.001076311,0.0008009828,0.0007063342,0.00005510582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004891462,"about_ca_system_score_gemma":0.000408123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003184565,"about_ca_topic_score_gemma":0.00001463886,"domain_scores_codex":[0.9967036,0.00005497555,0.0005285099,0.001415662,0.0008199145,0.0004773166],"domain_scores_gemma":[0.9976056,0.0002479499,0.0003635128,0.001363722,0.0002668833,0.0001523774],"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.000005928512,0.00002769025,0.00005047861,0.00006116035,0.000006690022,0.000009801355,0.0006466402,0.01538788,0.0008997261,0.4132496,0.000005948663,0.5696484],"study_design_scores_gemma":[0.0004298838,0.0003041335,0.001813381,0.0006672796,0.00001454036,0.0001321754,5.75401e-7,0.6137981,0.001994172,0.3788296,0.001147906,0.0008682465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000198766,0.0003118395,0.9925509,0.0004353425,0.001760169,0.0003886184,0.000003936478,0.0002322068,0.004118187],"genre_scores_gemma":[0.164396,0.00008160302,0.8346881,0.0004298048,0.0001833816,0.00001654166,0.00001118047,0.000025616,0.0001677729],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5984102,"threshold_uncertainty_score":0.9998226,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03864510337095927,"score_gpt":0.2801056129983279,"score_spread":0.2414605096273686,"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."}}