{"id":"W1509427512","doi":"10.1007/978-3-540-30494-4_4","title":"A Methodology for the Formal Verification of FFT Algorithms in HOL","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Fast Fourier transform; Mathematical proof; Computer science; Algorithm; Automated theorem proving; Split-radix FFT algorithm; Fixed point; Proof assistant; Formal verification; Arithmetic; Mathematics; Theoretical computer science; Programming language; Fourier transform; Fourier analysis","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.003175109,0.0003320223,0.0005735157,0.0004986042,0.000153974,0.0001240358,0.003016567,0.0002589552,0.000005574741],"category_scores_gemma":[0.0003297596,0.000235152,0.0001635708,0.0007124004,0.0007012882,0.0004095434,0.0006839633,0.0005605681,0.000002921541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001830208,"about_ca_system_score_gemma":0.000462618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008274985,"about_ca_topic_score_gemma":0.00002677949,"domain_scores_codex":[0.9971828,0.00009322783,0.0006197711,0.0009830409,0.0005300744,0.0005910603],"domain_scores_gemma":[0.9955986,0.002697642,0.0003652236,0.001057951,0.0002027728,0.00007785875],"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.000007252801,0.00002101958,0.00000577182,0.00002740806,0.000006319072,0.000005601102,0.0005025606,0.009796079,0.0002684247,0.0729924,0.000001041973,0.9163661],"study_design_scores_gemma":[0.0003082782,0.0002443746,0.0002079232,0.0001274354,0.000006908439,0.00002059122,4.085676e-7,0.539142,0.002479405,0.4566126,0.0005770412,0.0002729692],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001316786,0.0005084872,0.9958549,0.001212052,0.001498014,0.0006785834,0.000006491044,0.00003759757,0.0001906656],"genre_scores_gemma":[0.006210668,0.00005498081,0.9928249,0.0005720801,0.0002400006,0.00003932536,0.000001692723,0.00001764091,0.00003877519],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9160932,"threshold_uncertainty_score":0.9589218,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0689537982563607,"score_gpt":0.3314530027488482,"score_spread":0.2624992044924875,"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."}}