{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005324659,0.001210478,0.001148848,0.00168556,0.001852555,0.004098569,0.003924754,0.001619562,0.01244674],"category_scores_gemma":[0.01789683,0.001291606,0.003151325,0.001092049,0.005515294,0.007975622,0.005005402,0.004460242,0.002647024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001690479,"about_ca_system_score_gemma":0.002296517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002630476,"about_ca_topic_score_gemma":0.002499582,"domain_scores_codex":[0.9950912,0.001588232,0.0005957189,0.0006156506,0.001628148,0.0004810482],"domain_scores_gemma":[0.9877635,0.007301688,0.0004142929,0.003027334,0.001306005,0.0001872723],"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.00008833865,0.00008687458,0.0004358354,0.0003664316,0.00005728009,0.0002192201,0.0006008125,0.01273842,0.004330616,0.9104606,0.003657663,0.0669579],"study_design_scores_gemma":[0.00008212477,0.00006928248,0.0002019887,0.0001645959,0.00008019206,0.0002346287,0.0001455301,0.07381945,0.01365356,0.8828569,0.02862871,0.00006304753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001649202,0.00009163002,0.9934269,0.0001483258,0.0000790221,0.00006972632,0.0000671135,0.001537726,0.002930342],"genre_scores_gemma":[0.175777,0.0004510742,0.8138077,0.0004085271,0.0002523342,0.000447303,0.0004820389,0.001691769,0.006682258],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01244674,"threshold_uncertainty_score":0.04163849,"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."}}